:: VECTSP_5 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
:: deftheorem Def1 defines + VECTSP_5:def 1 :
Lm1:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds W1 + W2 = W2 + W1
:: deftheorem Def2 defines /\ VECTSP_5:def 2 :
theorem :: VECTSP_5:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th5: :: VECTSP_5:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: VECTSP_5:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: VECTSP_5:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm2:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds the carrier of W1 c= the carrier of (W1 + W2)
Lm3:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1 being Subspace of M
for W2 being strict Subspace of M st the carrier of W1 c= the carrier of W2 holds
W1 + W2 = W2
theorem :: VECTSP_5:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: VECTSP_5:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: VECTSP_5:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: VECTSP_5:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: VECTSP_5:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm4:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of M ex W' being strict Subspace of M st the carrier of W = the carrier of W'
Lm5:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W, W', W1 being Subspace of M st the carrier of W = the carrier of W' holds
( W1 + W = W1 + W' & W + W1 = W' + W1 )
Lm6:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of M holds W is Subspace of (Omega). M
theorem Th14: :: VECTSP_5:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: VECTSP_5:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th19: :: VECTSP_5:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm7:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds the carrier of (W1 /\ W2) c= the carrier of W1
theorem Th20: :: VECTSP_5:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm8:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W, W', W1 being Subspace of M st the carrier of W = the carrier of W' holds
( W1 /\ W = W1 /\ W' & W /\ W1 = W' /\ W1 )
theorem Th21: :: VECTSP_5:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: VECTSP_5:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th27: :: VECTSP_5:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm9:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds the carrier of (W1 /\ W2) c= the carrier of (W1 + W2)
theorem :: VECTSP_5:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm10:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds the carrier of ((W1 /\ W2) + W2) = the carrier of W2
theorem Th30: :: VECTSP_5:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm11:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds the carrier of (W1 /\ (W1 + W2)) = the carrier of W1
theorem Th31: :: VECTSP_5:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm12:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2, W3 being Subspace of M holds the carrier of ((W1 /\ W2) + (W2 /\ W3)) c= the carrier of (W2 /\ (W1 + W3))
theorem :: VECTSP_5:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm13:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2, W3 being Subspace of M st W1 is Subspace of W2 holds
the carrier of (W2 /\ (W1 + W3)) = the carrier of ((W1 /\ W2) + (W2 /\ W3))
theorem Th33: :: VECTSP_5:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm14:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W2, W1, W3 being Subspace of M holds the carrier of (W2 + (W1 /\ W3)) c= the carrier of ((W1 + W2) /\ (W2 + W3))
theorem :: VECTSP_5:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm15:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2, W3 being Subspace of M st W1 is Subspace of W2 holds
the carrier of (W2 + (W1 /\ W3)) = the carrier of ((W1 + W2) /\ (W2 + W3))
theorem :: VECTSP_5:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: VECTSP_5:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def3 defines Subspaces VECTSP_5:def 3 :
theorem :: VECTSP_5:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def4 defines is_the_direct_sum_of VECTSP_5:def 4 :
Lm16:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M holds
( W1 + W2 = VectSpStr(# the carrier of M,the add of M,the Zero of M,the lmult of M #) iff for v being Element of M ex v1, v2 being Element of M st
( v1 in W1 & v2 in W2 & v = v1 + v2 ) )
:: deftheorem Def5 defines Linear_Compl VECTSP_5:def 5 :
Lm17:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for M being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of M st M is_the_direct_sum_of W1,W2 holds
M is_the_direct_sum_of W2,W1
theorem :: VECTSP_5:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: VECTSP_5:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: VECTSP_5:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th50: :: VECTSP_5:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th52: :: VECTSP_5:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th55: :: VECTSP_5:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th56: :: VECTSP_5:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: VECTSP_5:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def6 defines |-- VECTSP_5:def 6 :
theorem :: VECTSP_5:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th64: :: VECTSP_5:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th65: :: VECTSP_5:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let GF be non
empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let M be non
empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of
GF;
func SubJoin M -> BinOp of
Subspaces M means :
Def7:
:: VECTSP_5:def 7
for
A1,
A2 being
Element of
Subspaces M for
W1,
W2 being
Subspace of
M st
A1 = W1 &
A2 = W2 holds
it . A1,
A2 = W1 + W2;
existence
ex b1 being BinOp of Subspaces M st
for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b1 . A1,A2 = W1 + W2
uniqueness
for b1, b2 being BinOp of Subspaces M st ( for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b1 . A1,A2 = W1 + W2 ) & ( for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b2 . A1,A2 = W1 + W2 ) holds
b1 = b2
end;
:: deftheorem Def7 defines SubJoin VECTSP_5:def 7 :
definition
let GF be non
empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let M be non
empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of
GF;
func SubMeet M -> BinOp of
Subspaces M means :
Def8:
:: VECTSP_5:def 8
for
A1,
A2 being
Element of
Subspaces M for
W1,
W2 being
Subspace of
M st
A1 = W1 &
A2 = W2 holds
it . A1,
A2 = W1 /\ W2;
existence
ex b1 being BinOp of Subspaces M st
for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b1 . A1,A2 = W1 /\ W2
uniqueness
for b1, b2 being BinOp of Subspaces M st ( for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b1 . A1,A2 = W1 /\ W2 ) & ( for A1, A2 being Element of Subspaces M
for W1, W2 being Subspace of M st A1 = W1 & A2 = W2 holds
b2 . A1,A2 = W1 /\ W2 ) holds
b1 = b2
end;
:: deftheorem Def8 defines SubMeet VECTSP_5:def 8 :
theorem :: VECTSP_5:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_5:74 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th75: :: VECTSP_5:75 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th76: :: VECTSP_5:76 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th77: :: VECTSP_5:77 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th78: :: VECTSP_5:78 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:79 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_5:80 :: Showing IDV graph ... (Click the Palm Tree again to close it)