let GF be non empty right_complementable well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr ; :: thesis: for V being non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital Abelian add-associative right_zeroed ModuleStr over GF
for v1, v2 being Element of V st v1 <> v2 holds
for l being Linear_Combination of {v1,v2} holds Sum l = ((l . v1) * v1) + ((l . v2) * v2)
let V be non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital Abelian add-associative right_zeroed ModuleStr over GF; :: thesis: for v1, v2 being Element of V st v1 <> v2 holds
for l being Linear_Combination of {v1,v2} holds Sum l = ((l . v1) * v1) + ((l . v2) * v2)
let v1, v2 be Element of V; :: thesis: ( v1 <> v2 implies for l being Linear_Combination of {v1,v2} holds Sum l = ((l . v1) * v1) + ((l . v2) * v2) )
assume A1: v1 <> v2 ; :: thesis: for l being Linear_Combination of {v1,v2} holds Sum l = ((l . v1) * v1) + ((l . v2) * v2)
let l be Linear_Combination of {v1,v2}; :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)
A2: Carrier l c= {v1,v2} by Def4;

now :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)

per cases ( Carrier l = {} or Carrier l = {v1} or Carrier l = {v2} or Carrier l = {v1,v2} ) by A2, ZFMISC_1:36;

suppose Carrier l = {} ; :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)

then A3: l = ZeroLC V by Def3;
hence Sum l = 0. V by Lm1
.= (0. V) + (0. V) by RLVECT_1:4
.= ((0. GF) * v1) + (0. V) by VECTSP_1:14
.= ((0. GF) * v1) + ((0. GF) * v2) by VECTSP_1:14
.= ((l . v1) * v1) + ((0. GF) * v2) by A3, Th3
.= ((l . v1) * v1) + ((l . v2) * v2) by A3, Th3 ;
:: thesis: verum

end;

suppose A4: Carrier l = {v1} ; :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)

then reconsider L = l as Linear_Combination of {v1} by Def4;
A5: not v2 in Carrier l by A1, A4, TARSKI:def 1;
thus Sum l = Sum L
.= (l . v1) * v1 by Th17
.= ((l . v1) * v1) + (0. V) by RLVECT_1:4
.= ((l . v1) * v1) + ((0. GF) * v2) by VECTSP_1:14
.= ((l . v1) * v1) + ((l . v2) * v2) by A5 ; :: thesis: verum

end;

suppose A6: Carrier l = {v2} ; :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)

then reconsider L = l as Linear_Combination of {v2} by Def4;
A7: not v1 in Carrier l by A1, A6, TARSKI:def 1;
thus Sum l = Sum L
.= (l . v2) * v2 by Th17
.= (0. V) + ((l . v2) * v2) by RLVECT_1:4
.= ((0. GF) * v1) + ((l . v2) * v2) by VECTSP_1:14
.= ((l . v1) * v1) + ((l . v2) * v2) by A7 ; :: thesis: verum

end;

suppose Carrier l = {v1,v2} ; :: thesis: Sum l = ((l . v1) * v1) + ((l . v2) * v2)

then consider F being FinSequence of V such that
A8: ( F is one-to-one & rng F = {v1,v2} ) and
A9: Sum l = Sum (l (#) F) by Def6;
( F = <*v1,v2*> or F = <*v2,v1*> ) by A1, A8, FINSEQ_3:99;
then ( l (#) F = <*((l . v1) * v1),((l . v2) * v2)*> or l (#) F = <*((l . v2) * v2),((l . v1) * v1)*> ) by Th11;
hence Sum l = ((l . v1) * v1) + ((l . v2) * v2) by A9, RLVECT_1:45; :: thesis: verum

end;

end;

end;

hence Sum l = ((l . v1) * v1) + ((l . v2) * v2) ; :: thesis: verum