:: VECTSP_4 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative commutative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a, b being Element of GF
for v being Element of V holds (a - b) * v = (a * v) - (b * v)
:: deftheorem Def1 defines lineary-closed VECTSP_4:def 1 :
theorem :: VECTSP_4:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th4: :: VECTSP_4:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: VECTSP_4:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: VECTSP_4:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def2 defines Subspace VECTSP_4:def 2 :
theorem :: VECTSP_4:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: VECTSP_4:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: VECTSP_4:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: VECTSP_4:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: VECTSP_4:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th22: :: VECTSP_4:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: VECTSP_4:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: VECTSP_4:24 :: 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 V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for V1 being Subset of V st the carrier of W = V1 holds
V1 is lineary-closed
theorem Th25: :: VECTSP_4:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: VECTSP_4:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: VECTSP_4:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: VECTSP_4:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: VECTSP_4:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: VECTSP_4:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: VECTSP_4:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: VECTSP_4:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: VECTSP_4:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: VECTSP_4:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th38: :: VECTSP_4:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th42: :: VECTSP_4:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def3 defines (0). VECTSP_4:def 3 :
:: deftheorem defines (Omega). VECTSP_4:def 4 :
theorem :: VECTSP_4:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: VECTSP_4:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: VECTSP_4:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines + VECTSP_4:def 5 :
Lm3:
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0. V) + W = the carrier of W
:: deftheorem Def6 defines Coset VECTSP_4:def 6 :
theorem :: VECTSP_4:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th57: :: VECTSP_4:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: VECTSP_4:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th59: :: VECTSP_4:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th61: :: VECTSP_4:61 :: 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 V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( v in W iff v + W = the carrier of W )
theorem Th62: :: VECTSP_4:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th63: :: VECTSP_4:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th65: :: VECTSP_4:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th66: :: VECTSP_4:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th68: :: VECTSP_4:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th70: :: VECTSP_4:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th71: :: VECTSP_4:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th73: :: VECTSP_4:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:74 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th75: :: VECTSP_4:75 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:76 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:77 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:78 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th79: :: VECTSP_4:79 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th80: :: VECTSP_4:80 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th81: :: VECTSP_4:81 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th82: :: VECTSP_4:82 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th83: :: VECTSP_4:83 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:84 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:85 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:86 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:87 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:88 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:89 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:90 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:91 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:92 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th93: :: VECTSP_4:93 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:94 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:95 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:96 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:97 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP_4:98 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:99 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:100 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:101 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:102 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: VECTSP_4:103 :: Showing IDV graph ... (Click the Palm Tree again to close it)