:: VECTSP_9 semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

registration
let S be non empty 1-sorted ;
cluster non empty Element of K40(the carrier of S);
existence
not for b1 being Subset of S holds b1 is empty
proof end;
end;

theorem Th1: :: VECTSP_9:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for n being Nat
for X being finite set st n <= card X holds
ex A being finite Subset of X st Card A = n
proof end;

theorem Th2: :: VECTSP_9:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for f being Function st f is one-to-one & x in rng f holds
Card (f " {x}) = 1
proof end;

theorem :: VECTSP_9:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for f being Function st not x in rng f holds
Card (f " {x}) = 0 by CARD_1:78, FUNCT_1:142;

theorem Th4: :: VECTSP_9:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for f, g being Function st rng f = rng g & f is one-to-one & g is one-to-one holds
f,g are_fiberwise_equipotent
proof end;

Lm1: for X, x being set st x in X holds
(X \ {x}) \/ {x} = X
proof end;

theorem Th5: :: VECTSP_9:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for L being Linear_Combination of V
for F, G being FinSequence of the carrier of V
for P being Permutation of dom F st G = F * P holds
Sum (L (#) F) = Sum (L (#) G)
proof end;

theorem Th6: :: VECTSP_9:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for L being Linear_Combination of V
for F being FinSequence of the carrier of V st Carrier L misses rng F holds
Sum (L (#) F) = 0. V
proof end;

theorem Th7: :: VECTSP_9:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for F being FinSequence of the carrier of V st F is one-to-one holds
for L being Linear_Combination of V st Carrier L c= rng F holds
Sum (L (#) F) = Sum L
proof end;

theorem Th8: :: VECTSP_9:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for L being Linear_Combination of V
for F being FinSequence of the carrier of V ex K being Linear_Combination of V st
( Carrier K = (rng F) /\ (Carrier L) & L (#) F = K (#) F )
proof end;

theorem Th9: :: VECTSP_9:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for L being Linear_Combination of V
for A being Subset of V
for F being FinSequence of the carrier of V st rng F c= the carrier of (Lin A) holds
ex K being Linear_Combination of A st Sum (L (#) F) = Sum K
proof end;

theorem Th10: :: VECTSP_9:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for L being Linear_Combination of V
for A being Subset of V st Carrier L c= the carrier of (Lin A) holds
ex K being Linear_Combination of A st Sum L = Sum K
proof end;

theorem Th11: :: VECTSP_9:11  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for L being Linear_Combination of V st Carrier L c= the carrier of W holds
for K being Linear_Combination of W st K = L | the carrier of W holds
( Carrier L = Carrier K & Sum L = Sum K )
proof end;

theorem Th12: :: VECTSP_9:12  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for K being Linear_Combination of W ex L being Linear_Combination of V st
( Carrier K = Carrier L & Sum K = Sum L )
proof end;

theorem Th13: :: VECTSP_9:13  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for L being Linear_Combination of V st Carrier L c= the carrier of W holds
ex K being Linear_Combination of W st
( Carrier K = Carrier L & Sum K = Sum L )
proof end;

theorem Th14: :: VECTSP_9:14  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for I being Basis of V
for v being Vector of V holds v in Lin I
proof end;

theorem Th15: :: VECTSP_9:15  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for A being Subset of W st A is linearly-independent holds
A is linearly-independent Subset of V
proof end;

theorem Th16: :: VECTSP_9:16  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for A being Subset of V st A is linearly-independent & A c= the carrier of W holds
A is linearly-independent Subset of W
proof end;

theorem Th17: :: VECTSP_9:17  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for A being Basis of W ex B being Basis of V st A c= B
proof end;

theorem Th18: :: VECTSP_9:18  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for A being Subset of V st A is linearly-independent holds
for v being Vector of V st v in A holds
for B being Subset of V st B = A \ {v} holds
not v in Lin B
proof end;

theorem Th19: :: VECTSP_9:19  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for I being Basis of V
for A being non empty Subset of V st A misses I holds
for B being Subset of V st B = I \/ A holds
not B is linearly-independent
proof end;

theorem Th20: :: VECTSP_9:20  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for A being Subset of V st A c= the carrier of W holds
Lin A is Subspace of W
proof end;

theorem Th21: :: VECTSP_9:21  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V
for A being Subset of V
for B being Subset of W st A = B holds
Lin A = Lin B
proof end;

theorem Th22: :: VECTSP_9:22  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for A, B being finite Subset of V
for v being Vector of V st v in Lin (A \/ B) & not v in Lin B holds
ex w being Vector of V st
( w in A & w in Lin (((A \/ B) \ {w}) \/ {v}) )
proof end;

theorem Th23: :: VECTSP_9:23  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for A, B being finite Subset of V st VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) = Lin A & B is linearly-independent holds
( card B <= card A & ex C being finite Subset of V st
( C c= A & card C = (card A) - (card B) & VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) = Lin (B \/ C) ) )
proof end;

definition
let GF be Field;
let V be VectSp of GF;
redefine attr V is finite-dimensional means :Def1: :: VECTSP_9:def 1
ex I being finite Subset of V st I is Basis of V;
compatibility
( V is finite-dimensional iff ex I being finite Subset of V st I is Basis of V )
by MATRLIN:def 3;
end;

:: deftheorem Def1 defines finite-dimensional VECTSP_9:def 1 :
for GF being Field
for V being VectSp of GF holds
( V is finite-dimensional iff ex I being finite Subset of V st I is Basis of V );

theorem Th24: :: VECTSP_9:24  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF st V is finite-dimensional holds
for I being Basis of V holds I is finite
proof end;

theorem :: VECTSP_9:25  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF st V is finite-dimensional holds
for A being Subset of V st A is linearly-independent holds
A is finite
proof end;

theorem Th26: :: VECTSP_9:26  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF st V is finite-dimensional holds
for A, B being Basis of V holds Card A = Card B
proof end;

theorem Th27: :: VECTSP_9:27  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF holds (0). V is finite-dimensional
proof end;

theorem Th28: :: VECTSP_9:28  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for W being Subspace of V st V is finite-dimensional holds
W is finite-dimensional
proof end;

registration
let GF be Field;
let V be VectSp of GF;
cluster strict finite-dimensional Subspace of V;
existence
ex b1 being Subspace of V st
( b1 is strict & b1 is finite-dimensional )
proof end;
end;

registration
let GF be Field;
let V be finite-dimensional VectSp of GF;
cluster -> finite-dimensional Subspace of V;
correctness
coherence
for b1 being Subspace of V holds b1 is finite-dimensional
;
by Th28;
end;

registration
let GF be Field;
let V be finite-dimensional VectSp of GF;
cluster strict finite-dimensional Subspace of V;
existence
ex b1 being Subspace of V st b1 is strict
proof end;
end;

definition
let GF be Field;
let V be VectSp of GF;
assume A1: V is finite-dimensional ;
func dim V -> Nat means :Def2: :: VECTSP_9:def 2
for I being Basis of V holds it = Card I;
existence
ex b1 being Nat st
for I being Basis of V holds b1 = Card I
proof end;
uniqueness
for b1, b2 being Nat st ( for I being Basis of V holds b1 = Card I ) & ( for I being Basis of V holds b2 = Card I ) holds
b1 = b2
proof end;
end;

:: deftheorem Def2 defines dim VECTSP_9:def 2 :
for GF being Field
for V being VectSp of GF st V is finite-dimensional holds
for b3 being Nat holds
( b3 = dim V iff for I being Basis of V holds b3 = Card I );

theorem Th29: :: VECTSP_9:29  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for W being Subspace of V holds dim W <= dim V
proof end;

theorem Th30: :: VECTSP_9:30  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for A being Subset of V st A is linearly-independent holds
Card A = dim (Lin A)
proof end;

theorem Th31: :: VECTSP_9:31  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF holds dim V = dim ((Omega). V)
proof end;

theorem :: VECTSP_9:32  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for W being Subspace of V holds
( dim V = dim W iff (Omega). V = (Omega). W )
proof end;

theorem Th33: :: VECTSP_9:33  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF holds
( dim V = 0 iff (Omega). V = (0). V )
proof end;

theorem :: VECTSP_9:34  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF holds
( dim V = 1 iff ex v being Vector of V st
( v <> 0. V & (Omega). V = Lin {v} ) )
proof end;

theorem :: VECTSP_9:35  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF holds
( dim V = 2 iff ex u, v being Vector of V st
( u <> v & {u,v} is linearly-independent & (Omega). V = Lin {u,v} ) )
proof end;

theorem Th36: :: VECTSP_9:36  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for W1, W2 being Subspace of V holds (dim (W1 + W2)) + (dim (W1 /\ W2)) = (dim W1) + (dim W2)
proof end;

theorem :: VECTSP_9:37  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for W1, W2 being Subspace of V holds dim (W1 /\ W2) >= ((dim W1) + (dim W2)) - (dim V)
proof end;

theorem :: VECTSP_9:38  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being finite-dimensional VectSp of GF
for W1, W2 being Subspace of V st V is_the_direct_sum_of W1,W2 holds
dim V = (dim W1) + (dim W2)
proof end;

Lm2: for GF being Field
for n being Nat
for V being finite-dimensional VectSp of GF st n <= dim V holds
ex W being strict Subspace of V st dim W = n
proof end;

theorem :: VECTSP_9:39  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for n being Nat
for V being finite-dimensional VectSp of GF holds
( n <= dim V iff ex W being strict Subspace of V st dim W = n ) by Lm2, Th29;

definition
let GF be Field;
let V be finite-dimensional VectSp of GF;
let n be Nat;
func n Subspaces_of V -> set means :Def3: :: VECTSP_9:def 3
for x being set holds
( x in it iff ex W being strict Subspace of V st
( W = x & dim W = n ) );
existence
ex b1 being set st
for x being set holds
( x in b1 iff ex W being strict Subspace of V st
( W = x & dim W = n ) )
proof end;
uniqueness
for b1, b2 being set st ( for x being set holds
( x in b1 iff ex W being strict Subspace of V st
( W = x & dim W = n ) ) ) & ( for x being set holds
( x in b2 iff ex W being strict Subspace of V st
( W = x & dim W = n ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def3 defines Subspaces_of VECTSP_9:def 3 :
for GF being Field
for V being finite-dimensional VectSp of GF
for n being Nat
for b4 being set holds
( b4 = n Subspaces_of V iff for x being set holds
( x in b4 iff ex W being strict Subspace of V st
( W = x & dim W = n ) ) );

theorem :: VECTSP_9:40  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for n being Nat
for V being finite-dimensional VectSp of GF st n <= dim V holds
not n Subspaces_of V is empty
proof end;

theorem :: VECTSP_9:41  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for n being Nat
for V being finite-dimensional VectSp of GF st dim V < n holds
n Subspaces_of V = {}
proof end;

theorem :: VECTSP_9:42  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for n being Nat
for V being finite-dimensional VectSp of GF
for W being Subspace of V holds n Subspaces_of W c= n Subspaces_of V
proof end;