reserve x for set;
reserve a,b,c,d,e,r1,r2,r3,r4,r5,r6 for Real;
reserve V for RealLinearSpace;
reserve u,v,v1,v2,v3,w,w1,w2,w3 for VECTOR of V;
reserve W,W1,W2 for Subspace of V;

theorem
  {u,v} is linearly-independent & u <> v implies {u,v + u} is
  linearly-independent
proof
  assume
A1: {u,v} is linearly-independent & u <> v;
  now
    let a,b;
    assume a * u + b * (v + u) = 0.V;
    then
A2: 0.V = a * u + (b * u + b * v) by RLVECT_1:def 5
      .= a * u + b * u + b * v by RLVECT_1:def 3
      .= (a + b) * u + b * v by RLVECT_1:def 6;
    then b = 0 by A1,RLVECT_3:13;
    hence a = 0 & b = 0 by A1,A2,RLVECT_3:13;
  end;
  hence thesis by RLVECT_3:13;
end;
