let GF be Field; :: thesis: for V being VectSp of GF
for A being Subset of V st A is linearly-independent holds
ex B being Subset of V st
( A c= B & B is linearly-independent & Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) )

let V be VectSp of GF; :: thesis: for A being Subset of V st A is linearly-independent holds
ex B being Subset of V st
( A c= B & B is linearly-independent & Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) )

let A be Subset of V; :: thesis: ( A is linearly-independent implies ex B being Subset of V st
( A c= B & B is linearly-independent & Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) ) )

assume A1: A is linearly-independent ; :: thesis: ex B being Subset of V st
( A c= B & B is linearly-independent & Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) )

defpred S1[ set ] means ex B being Subset of V st
( B = $1 & A c= B & B is linearly-independent );
consider Q being set such that
A2: for Z being set holds
( Z in Q iff ( Z in bool the carrier of V & S1[Z] ) ) from XBOOLE_0:sch 1();
A3: Q <> {} by A1, A2;
now
let Z be set ; :: thesis: ( Z <> {} & Z c= Q & Z is c=-linear implies union Z in Q )
assume that
A4: Z <> {} and
A5: Z c= Q and
A6: Z is c=-linear ; :: thesis: union Z in Q
set W = union Z;
union Z c= the carrier of V
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in union Z or x in the carrier of V )
assume x in union Z ; :: thesis: x in the carrier of V
then consider X being set such that
A7: x in X and
A8: X in Z by TARSKI:def 4;
X in bool the carrier of V by A2, A5, A8;
hence x in the carrier of V by A7; :: thesis: verum
end;
then reconsider W = union Z as Subset of V ;
consider x being Element of Z;
x in Q by A4, A5, TARSKI:def 3;
then A9: ex B being Subset of V st
( B = x & A c= B & B is linearly-independent ) by A2;
x c= W by A4, ZFMISC_1:92;
then A10: A c= W by A9, XBOOLE_1:1;
W is linearly-independent
proof
let l be Linear_Combination of W; :: according to VECTSP_7:def 1 :: thesis: ( Sum l = 0. V implies Carrier l = {} )
assume that
A11: Sum l = 0. V and
A12: Carrier l <> {} ; :: thesis: contradiction
deffunc H1( set ) -> set = { C where C is Subset of V : ( $1 in C & C in Z ) } ;
consider f being Function such that
A13: dom f = Carrier l and
A14: for x being set st x in Carrier l holds
f . x = H1(x) from FUNCT_1:sch 3();
reconsider M = rng f as non empty set by A12, A13, RELAT_1:65;
consider F being Choice_Function of M;
A15: now
assume {} in M ; :: thesis: contradiction
then consider x being set such that
A16: x in dom f and
A17: f . x = {} by FUNCT_1:def 5;
Carrier l c= W by VECTSP_6:def 7;
then consider X being set such that
A18: x in X and
A19: X in Z by A13, A16, TARSKI:def 4;
reconsider X = X as Subset of V by A2, A5, A19;
X in { C where C is Subset of V : ( x in C & C in Z ) } by A18, A19;
hence contradiction by A13, A14, A16, A17; :: thesis: verum
end;
set S = rng F;
A20: ( dom F = M & M <> {} ) by A15, RLVECT_3:35;
then A21: rng F <> {} by RELAT_1:65;
A22: now
let X be set ; :: thesis: ( X in rng F implies X in Z )
assume X in rng F ; :: thesis: X in Z
then consider x being set such that
A23: x in dom F and
A24: F . x = X by FUNCT_1:def 5;
consider y being set such that
A25: y in dom f and
A26: f . y = x by A20, A23, FUNCT_1:def 5;
A27: X in x by A15, A20, A23, A24, ORDERS_1:def 1;
x = { C where C is Subset of V : ( y in C & C in Z ) } by A13, A14, A25, A26;
then ex C being Subset of V st
( C = X & y in C & C in Z ) by A27;
hence X in Z ; :: thesis: verum
end;
A28: now
let X, Y be set ; :: thesis: ( X in rng F & Y in rng F & not X c= Y implies Y c= X )
assume ( X in rng F & Y in rng F ) ; :: thesis: ( X c= Y or Y c= X )
then ( X in Z & Y in Z ) by A22;
then X,Y are_c=-comparable by A6, ORDINAL1:def 9;
hence ( X c= Y or Y c= X ) by XBOOLE_0:def 9; :: thesis: verum
end;
dom F is finite by A13, A20, FINSET_1:26;
then rng F is finite by FINSET_1:26;
then union (rng F) in rng F by A21, A28, CARD_2:81;
then union (rng F) in Z by A22;
then consider B being Subset of V such that
A29: B = union (rng F) and
A c= B and
A30: B is linearly-independent by A2, A5;
Carrier l c= union (rng F)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Carrier l or x in union (rng F) )
assume A31: x in Carrier l ; :: thesis: x in union (rng F)
then A32: f . x in M by A13, FUNCT_1:def 5;
set X = f . x;
A33: F . (f . x) in f . x by A15, A32, ORDERS_1:def 1;
f . x = { C where C is Subset of V : ( x in C & C in Z ) } by A14, A31;
then A34: ex C being Subset of V st
( F . (f . x) = C & x in C & C in Z ) by A33;
F . (f . x) in rng F by A20, A32, FUNCT_1:def 5;
hence x in union (rng F) by A34, TARSKI:def 4; :: thesis: verum
end;
then l is Linear_Combination of B by A29, VECTSP_6:def 7;
hence contradiction by A11, A12, A30, Def1; :: thesis: verum
end;
hence union Z in Q by A2, A10; :: thesis: verum
end;
then consider X being set such that
A35: X in Q and
A36: for Z being set st Z in Q & Z <> X holds
not X c= Z by A3, ORDERS_1:177;
consider B being Subset of V such that
A37: B = X and
A38: A c= B and
A39: B is linearly-independent by A2, A35;
take B ; :: thesis: ( A c= B & B is linearly-independent & Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) )
thus ( A c= B & B is linearly-independent ) by A38, A39; :: thesis: Lin B = VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #)
assume Lin B <> VectSpStr(# the carrier of V,the U5 of V,the U2 of V,the lmult of V #) ; :: thesis: contradiction
then consider v being Vector of V such that
A40: ( ( v in Lin B & not v in (Omega). V ) or ( v in (Omega). V & not v in Lin B ) ) by VECTSP_4:38;
A41: B \/ {v} is linearly-independent
proof
let l be Linear_Combination of B \/ {v}; :: according to VECTSP_7:def 1 :: thesis: ( Sum l = 0. V implies Carrier l = {} )
assume A42: Sum l = 0. V ; :: thesis: Carrier l = {}
now
per cases ( v in Carrier l or not v in Carrier l ) ;
suppose A43: v in Carrier l ; :: thesis: Carrier l = {}
deffunc H1( Vector of V) -> Element of the carrier of GF = l . $1;
consider f being Function of the carrier of V,the carrier of GF such that
A44: f . v = 0. GF and
A45: for u being Vector of V st u <> v holds
f . u = H1(u) from FUNCT_2:sch 6();
reconsider f = f as Element of Funcs the carrier of V,the carrier of GF by FUNCT_2:11;
now
let u be Vector of V; :: thesis: ( not u in (Carrier l) \ {v} implies f . u = 0. GF )
assume not u in (Carrier l) \ {v} ; :: thesis: f . u = 0. GF
then ( not u in Carrier l or u in {v} ) by XBOOLE_0:def 5;
then ( ( l . u = 0. GF & u <> v ) or u = v ) by TARSKI:def 1;
hence f . u = 0. GF by A44, A45; :: thesis: verum
end;
then reconsider f = f as Linear_Combination of V by VECTSP_6:def 4;
Carrier f c= B
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Carrier f or x in B )
assume x in Carrier f ; :: thesis: x in B
then consider u being Vector of V such that
A46: u = x and
A47: f . u <> 0. GF ;
f . u = l . u by A44, A45, A47;
then ( u in Carrier l & Carrier l c= B \/ {v} ) by A47, VECTSP_6:def 7;
then ( u in B or u in {v} ) by XBOOLE_0:def 3;
hence x in B by A44, A46, A47, TARSKI:def 1; :: thesis: verum
end;
then reconsider f = f as Linear_Combination of B by VECTSP_6:def 7;
deffunc H2( set ) -> Element of the carrier of GF = 0. GF;
consider g being Function of the carrier of V,the carrier of GF such that
A48: g . v = - (l . v) and
A49: for u being Vector of V st u <> v holds
g . u = H2(u) from FUNCT_2:sch 6();
reconsider g = g as Element of Funcs the carrier of V,the carrier of GF by FUNCT_2:11;
now
let u be Vector of V; :: thesis: ( not u in {v} implies g . u = 0. GF )
assume not u in {v} ; :: thesis: g . u = 0. GF
then u <> v by TARSKI:def 1;
hence g . u = 0. GF by A49; :: thesis: verum
end;
then reconsider g = g as Linear_Combination of V by VECTSP_6:def 4;
Carrier g c= {v}
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Carrier g or x in {v} )
assume x in Carrier g ; :: thesis: x in {v}
then ex u being Vector of V st
( x = u & g . u <> 0. GF ) ;
then x = v by A49;
hence x in {v} by TARSKI:def 1; :: thesis: verum
end;
then reconsider g = g as Linear_Combination of {v} by VECTSP_6:def 7;
A50: f - g = l
proof
let u be Vector of V; :: according to VECTSP_6:def 10 :: thesis: (f - g) . u = l . u
now
per cases ( v = u or v <> u ) ;
suppose A51: v = u ; :: thesis: (f - g) . u = l . u
thus (f - g) . u = (f . u) - (g . u) by VECTSP_6:73
.= (0. GF) + (- (- (l . v))) by A44, A48, A51, RLVECT_1:def 12
.= (l . v) + (0. GF) by RLVECT_1:30
.= l . u by A51, RLVECT_1:10 ; :: thesis: verum
end;
suppose A52: v <> u ; :: thesis: (f - g) . u = l . u
thus (f - g) . u = (f . u) - (g . u) by VECTSP_6:73
.= (l . u) - (g . u) by A45, A52
.= (l . u) - (0. GF) by A49, A52
.= l . u by RLVECT_1:26 ; :: thesis: verum
end;
end;
end;
hence (f - g) . u = l . u ; :: thesis: verum
end;
A53: Sum g = (- (l . v)) * v by A48, VECTSP_6:43;
0. V = (Sum f) - (Sum g) by A42, A50, VECTSP_6:80;
then Sum f = (0. V) + (Sum g) by VECTSP_2:22
.= (- (l . v)) * v by A53, RLVECT_1:10 ;
then A54: (- (l . v)) * v in Lin B by Th12;
l . v <> 0. GF by A43, VECTSP_6:20;
then A55: - (l . v) <> 0. GF by VECTSP_2:34;
((- (l . v)) " ) * ((- (l . v)) * v) = (((- (l . v)) " ) * (- (l . v))) * v by VECTSP_1:def 26
.= (1_ GF) * v by A55, VECTSP_1:def 22
.= v by VECTSP_1:def 26 ;
hence Carrier l = {} by A40, A54, RLVECT_1:3, VECTSP_4:29; :: thesis: verum
end;
end;
end;
hence Carrier l = {} ; :: thesis: verum
end;
v in {v} by TARSKI:def 1;
then A58: ( v in B \/ {v} & not v in B ) by A40, Th13, RLVECT_1:3, XBOOLE_0:def 3;
B c= B \/ {v} by XBOOLE_1:7;
then A c= B \/ {v} by A38, XBOOLE_1:1;
then B \/ {v} in Q by A2, A41;
hence contradiction by A36, A37, A58, XBOOLE_1:7; :: thesis: verum