:: PRVECT_1 semantic presentation
deffunc H1( 1-sorted ) -> set = the carrier of a1;
deffunc H2( LoopStr ) -> M5([:the carrier of a1,the carrier of a1:],the carrier of a1) = the add of a1;
deffunc H3( non empty LoopStr ) -> M5(the carrier of a1,the carrier of a1) = comp a1;
deffunc H4( LoopStr ) -> Element of the carrier of a1 = the Zero of a1;
theorem Th1: :: PRVECT_1:1
canceled;
theorem Th2: :: PRVECT_1:2
canceled;
theorem Th3: :: PRVECT_1:3
theorem Th4: :: PRVECT_1:4
Lemma23:
for G being non empty Abelian add-associative right_zeroed right_complementable LoopStr holds comp G is_an_inverseOp_wrt the add of G
theorem Th5: :: PRVECT_1:5
Lemma31:
for GS being non empty LoopStr st the add of GS is commutative & the add of GS is associative holds
( GS is Abelian & GS is add-associative )
Lemma32:
for GS being non empty LoopStr st the Zero of GS is_a_unity_wrt the add of GS holds
GS is right_zeroed
Lemma34:
for F being Field holds the mult of F is associative
theorem Th6: :: PRVECT_1:6
canceled;
theorem Th7: :: PRVECT_1:7
canceled;
theorem Th8: :: PRVECT_1:8
canceled;
theorem Th9: :: PRVECT_1:9
canceled;
theorem Th10: :: PRVECT_1:10
theorem Th11: :: PRVECT_1:11
Lemma36:
for F being Field holds the mult of F is_distributive_wrt the add of F
definition
let D be non
empty set ;
let F be
BinOp of
D;
let n be
Nat;
func product c2,
c3 -> BinOp of
a3 -tuples_on a1 means :
Def1:
:: PRVECT_1:def 1
for
x,
y being
Element of
n -tuples_on D holds
it . x,
y = F .: x,
y;
existence
ex b1 being BinOp of n -tuples_on D st
for x, y being Element of n -tuples_on D holds b1 . x,y = F .: x,y
uniqueness
for b1, b2 being BinOp of n -tuples_on D st ( for x, y being Element of n -tuples_on D holds b1 . x,y = F .: x,y ) & ( for x, y being Element of n -tuples_on D holds b2 . x,y = F .: x,y ) holds
b1 = b2
end;
:: deftheorem Def1 defines product PRVECT_1:def 1 :
:: deftheorem Def2 defines product PRVECT_1:def 2 :
theorem Th12: :: PRVECT_1:12
canceled;
theorem Th13: :: PRVECT_1:13
canceled;
theorem Th14: :: PRVECT_1:14
theorem Th15: :: PRVECT_1:15
theorem Th16: :: PRVECT_1:16
theorem Th17: :: PRVECT_1:17
:: deftheorem Def3 defines -Group_over PRVECT_1:def 3 :
definition
let F be
Field;
let n be
Nat;
func c2 -Mult_over c1 -> Function of
[:the carrier of a1,(a2 -tuples_on the carrier of a1):],
a2 -tuples_on the
carrier of
a1 means :
Def4:
:: PRVECT_1:def 4
for
x being
Element of
F for
v being
Element of
n -tuples_on the
carrier of
F holds
it . x,
v = the
mult of
F [;] x,
v;
existence
ex b1 being Function of [:the carrier of F,(n -tuples_on the carrier of F):],n -tuples_on the carrier of F st
for x being Element of F
for v being Element of n -tuples_on the carrier of F holds b1 . x,v = the mult of F [;] x,v
uniqueness
for b1, b2 being Function of [:the carrier of F,(n -tuples_on the carrier of F):],n -tuples_on the carrier of F st ( for x being Element of F
for v being Element of n -tuples_on the carrier of F holds b1 . x,v = the mult of F [;] x,v ) & ( for x being Element of F
for v being Element of n -tuples_on the carrier of F holds b2 . x,v = the mult of F [;] x,v ) holds
b1 = b2
end;
:: deftheorem Def4 defines -Mult_over PRVECT_1:def 4 :
:: deftheorem Def5 defines -VectSp_over PRVECT_1:def 5 :
theorem Th18: :: PRVECT_1:18
:: deftheorem Def6 PRVECT_1:def 6 :
canceled;
:: deftheorem Def7 PRVECT_1:def 7 :
canceled;
:: deftheorem Def8 defines BinOps PRVECT_1:def 8 :
:: deftheorem Def9 defines UnOps PRVECT_1:def 9 :
theorem Th19: :: PRVECT_1:19
theorem Th20: :: PRVECT_1:20
theorem Th21: :: PRVECT_1:21
theorem Th22: :: PRVECT_1:22
theorem Th23: :: PRVECT_1:23
theorem Th24: :: PRVECT_1:24
definition
let a be
Domain-Sequence;
let b be
BinOps of
a;
func [:c2:] -> BinOp of
product a1 means :
Def10:
:: PRVECT_1:def 10
for
f,
g being
Element of
product a for
i being
Element of
dom a holds
(it . f,g) . i = (b . i) . (f . i),
(g . i);
existence
ex b1 being BinOp of product a st
for f, g being Element of product a
for i being Element of dom a holds (b1 . f,g) . i = (b . i) . (f . i),(g . i)
uniqueness
for b1, b2 being BinOp of product a st ( for f, g being Element of product a
for i being Element of dom a holds (b1 . f,g) . i = (b . i) . (f . i),(g . i) ) & ( for f, g being Element of product a
for i being Element of dom a holds (b2 . f,g) . i = (b . i) . (f . i),(g . i) ) holds
b1 = b2
end;
:: deftheorem Def10 defines [: PRVECT_1:def 10 :
theorem Th25: :: PRVECT_1:25
theorem Th26: :: PRVECT_1:26
theorem Th27: :: PRVECT_1:27
theorem Th28: :: PRVECT_1:28
:: deftheorem Def11 defines AbGroup-yielding PRVECT_1:def 11 :
:: deftheorem Def12 defines carr PRVECT_1:def 12 :
:: deftheorem Def13 defines addop PRVECT_1:def 13 :
:: deftheorem Def14 defines complop PRVECT_1:def 14 :
:: deftheorem Def15 defines zeros PRVECT_1:def 15 :
:: deftheorem Def16 defines product PRVECT_1:def 16 :