:: SETWOP_2 semantic presentation
Lemma50:
for i being Element of NAT holds Seg i is Element of Fin NAT
by FINSUB_1:def 5;
theorem Th1: :: SETWOP_2:1
canceled;
theorem Th2: :: SETWOP_2:2
canceled;
theorem Th3: :: SETWOP_2:3
theorem Th4: :: SETWOP_2:4
theorem Th5: :: SETWOP_2:5
theorem Th6: :: SETWOP_2:6
theorem Th7: :: SETWOP_2:7
theorem Th8: :: SETWOP_2:8
theorem Th9: :: SETWOP_2:9
theorem Th10: :: SETWOP_2:10
theorem Th11: :: SETWOP_2:11
for
C,
D being non
empty set for
B being
Element of
Fin C for
e being
Element of
D for
F,
G being
BinOp of
D for
f,
f' being
Function of
C,
D st
F is
commutative &
F is
associative &
F has_a_unity &
e = the_unity_wrt F &
G . e,
e = e & ( for
d1,
d2,
d3,
d4 being
Element of
D holds
F . (G . d1,d2),
(G . d3,d4) = G . (F . d1,d3),
(F . d2,d4) ) holds
G . (F $$ B,f),
(F $$ B,f') = F $$ B,
(G .: f,f')
Lemma107:
for D being non empty set
for F being BinOp of D st F is commutative & F is associative holds
for d1, d2, d3, d4 being Element of D holds F . (F . d1,d2),(F . d3,d4) = F . (F . d1,d3),(F . d2,d4)
theorem Th12: :: SETWOP_2:12
theorem Th13: :: SETWOP_2:13
for
C,
D being non
empty set for
B being
Element of
Fin C for
F,
G being
BinOp of
D for
f,
f' being
Function of
C,
D st
F is
commutative &
F is
associative &
F has_a_unity &
F has_an_inverseOp &
G = F * (id D),
(the_inverseOp_wrt F) holds
G . (F $$ B,f),
(F $$ B,f') = F $$ B,
(G .: f,f')
theorem Th14: :: SETWOP_2:14
theorem Th15: :: SETWOP_2:15
theorem Th16: :: SETWOP_2:16
theorem Th17: :: SETWOP_2:17
theorem Th18: :: SETWOP_2:18
theorem Th19: :: SETWOP_2:19
theorem Th20: :: SETWOP_2:20
theorem Th21: :: SETWOP_2:21
:: deftheorem Def1 defines [#] SETWOP_2:def 1 :
theorem Th22: :: SETWOP_2:22
theorem Th23: :: SETWOP_2:23
theorem Th24: :: SETWOP_2:24
theorem Th25: :: SETWOP_2:25
theorem Th26: :: SETWOP_2:26
Lemma113:
for D being non empty set
for e being Element of D
for F being BinOp of D
for p, q being FinSequence of D st len p = len q & F . e,e = e holds
F .: ([#] p,e),([#] q,e) = [#] (F .: p,q),e
Lemma115:
for D being non empty set
for e, d being Element of D
for F being BinOp of D
for p being FinSequence of D st F . e,d = e holds
F [:] ([#] p,e),d = [#] (F [:] p,d),e
Lemma116:
for D being non empty set
for d, e being Element of D
for F being BinOp of D
for p being FinSequence of D st F . d,e = e holds
F [;] d,([#] p,e) = [#] (F [;] d,p),e
:: deftheorem Def2 defines $$ SETWOP_2:def 2 :
theorem Th27: :: SETWOP_2:27
canceled;
theorem Th28: :: SETWOP_2:28
canceled;
theorem Th29: :: SETWOP_2:29
canceled;
theorem Th30: :: SETWOP_2:30
canceled;
theorem Th31: :: SETWOP_2:31
canceled;
theorem Th32: :: SETWOP_2:32
canceled;
theorem Th33: :: SETWOP_2:33
canceled;
theorem Th34: :: SETWOP_2:34
canceled;
theorem Th35: :: SETWOP_2:35
theorem Th36: :: SETWOP_2:36
canceled;
theorem Th37: :: SETWOP_2:37
theorem Th38: :: SETWOP_2:38
theorem Th39: :: SETWOP_2:39
theorem Th40: :: SETWOP_2:40
theorem Th41: :: SETWOP_2:41
theorem Th42: :: SETWOP_2:42
theorem Th43: :: SETWOP_2:43
for
D being non
empty set for
e being
Element of
D for
F,
G being
BinOp of
D for
p,
q being
FinSequence of
D st
F is
commutative &
F is
associative &
F has_a_unity &
e = the_unity_wrt F &
G . e,
e = e & ( for
d1,
d2,
d3,
d4 being
Element of
D holds
F . (G . d1,d2),
(G . d3,d4) = G . (F . d1,d3),
(F . d2,d4) ) &
len p = len q holds
G . (F "**" p),
(F "**" q) = F "**" (G .: p,q)
theorem Th44: :: SETWOP_2:44
for
D being non
empty set for
e being
Element of
D for
F,
G being
BinOp of
D for
i being
Element of
NAT for
T1,
T2 being
Element of
i -tuples_on D st
F is
commutative &
F is
associative &
F has_a_unity &
e = the_unity_wrt F &
G . e,
e = e & ( for
d1,
d2,
d3,
d4 being
Element of
D holds
F . (G . d1,d2),
(G . d3,d4) = G . (F . d1,d3),
(F . d2,d4) ) holds
G . (F "**" T1),
(F "**" T2) = F "**" (G .: T1,T2)
theorem Th45: :: SETWOP_2:45
theorem Th46: :: SETWOP_2:46
theorem Th47: :: SETWOP_2:47
theorem Th48: :: SETWOP_2:48
theorem Th49: :: SETWOP_2:49
theorem Th50: :: SETWOP_2:50
theorem Th51: :: SETWOP_2:51
theorem Th52: :: SETWOP_2:52