:: VECTSP10 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
:: deftheorem defines StructVectSp VECTSP10:def 1 :
theorem :: VECTSP10:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th2: :: VECTSP10:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: VECTSP10:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: VECTSP10:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: VECTSP10:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: VECTSP10:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: VECTSP10:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: VECTSP10:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: VECTSP10:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: VECTSP10:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: VECTSP10:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: VECTSP10:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: VECTSP10:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: VECTSP10:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: VECTSP10:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: VECTSP10:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: VECTSP10:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: VECTSP10:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th20: :: VECTSP10:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: VECTSP10:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines CosetSet VECTSP10:def 2 :
definition
let K be non
empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be
VectSp of
K;
let W be
Subspace of
V;
func addCoset V,
W -> BinOp of
CosetSet V,
W means :
Def3:
:: VECTSP10:def 3
for
A,
B being
Element of
CosetSet V,
W for
a,
b being
Vector of
V st
A = a + W &
B = b + W holds
it . A,
B = (a + b) + W;
existence
ex b1 being BinOp of CosetSet V,W st
for A, B being Element of CosetSet V,W
for a, b being Vector of V st A = a + W & B = b + W holds
b1 . A,B = (a + b) + W
uniqueness
for b1, b2 being BinOp of CosetSet V,W st ( for A, B being Element of CosetSet V,W
for a, b being Vector of V st A = a + W & B = b + W holds
b1 . A,B = (a + b) + W ) & ( for A, B being Element of CosetSet V,W
for a, b being Vector of V st A = a + W & B = b + W holds
b2 . A,B = (a + b) + W ) holds
b1 = b2
end;
:: deftheorem Def3 defines addCoset VECTSP10:def 3 :
:: deftheorem defines zeroCoset VECTSP10:def 4 :
definition
let K be non
empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be
VectSp of
K;
let W be
Subspace of
V;
func lmultCoset V,
W -> Function of
[:the carrier of K,(CosetSet V,W):],
CosetSet V,
W means :
Def5:
:: VECTSP10:def 5
for
z being
Element of
K for
A being
Element of
CosetSet V,
W for
a being
Vector of
V st
A = a + W holds
it . z,
A = (z * a) + W;
existence
ex b1 being Function of [:the carrier of K,(CosetSet V,W):], CosetSet V,W st
for z being Element of K
for A being Element of CosetSet V,W
for a being Vector of V st A = a + W holds
b1 . z,A = (z * a) + W
uniqueness
for b1, b2 being Function of [:the carrier of K,(CosetSet V,W):], CosetSet V,W st ( for z being Element of K
for A being Element of CosetSet V,W
for a being Vector of V st A = a + W holds
b1 . z,A = (z * a) + W ) & ( for z being Element of K
for A being Element of CosetSet V,W
for a being Vector of V st A = a + W holds
b2 . z,A = (z * a) + W ) holds
b1 = b2
end;
:: deftheorem Def5 defines lmultCoset VECTSP10:def 5 :
definition
let K be non
empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be
VectSp of
K;
let W be
Subspace of
V;
func VectQuot V,
W -> non
empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of
K means :
Def6:
:: VECTSP10:def 6
( the
carrier of
it = CosetSet V,
W & the
add of
it = addCoset V,
W & the
Zero of
it = zeroCoset V,
W & the
lmult of
it = lmultCoset V,
W );
existence
ex b1 being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of K st
( the carrier of b1 = CosetSet V,W & the add of b1 = addCoset V,W & the Zero of b1 = zeroCoset V,W & the lmult of b1 = lmultCoset V,W )
uniqueness
for b1, b2 being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of K st the carrier of b1 = CosetSet V,W & the add of b1 = addCoset V,W & the Zero of b1 = zeroCoset V,W & the lmult of b1 = lmultCoset V,W & the carrier of b2 = CosetSet V,W & the add of b2 = addCoset V,W & the Zero of b2 = zeroCoset V,W & the lmult of b2 = lmultCoset V,W holds
b1 = b2
;
end;
:: deftheorem Def6 defines VectQuot VECTSP10:def 6 :
theorem Th22: :: VECTSP10:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: VECTSP10:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: VECTSP10:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: VECTSP10:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def7 defines constant VECTSP10:def 7 :
:: deftheorem Def8 defines coeffFunctional VECTSP10:def 8 :
theorem Th29: :: VECTSP10:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: VECTSP10:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: VECTSP10:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: VECTSP10:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines ker VECTSP10:def 9 :
theorem Th34: :: VECTSP10:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def10 defines degenerated VECTSP10:def 10 :
:: deftheorem Def11 defines Ker VECTSP10:def 11 :
:: deftheorem Def12 defines QFunctional VECTSP10:def 12 :
theorem Th35: :: VECTSP10:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines CQFunctional VECTSP10:def 13 :
theorem Th36: :: VECTSP10:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)