:: YELLOW_3 semantic presentation
theorem Th1: :: YELLOW_3:1
Lemma2:
for b1, b2, b3, b4, b5 being set holds
( b1 = [[b2,b3],[b4,b5]] implies ( (b1 `1 ) `1 = b2 & (b1 `1 ) `2 = b3 & (b1 `2 ) `1 = b4 & (b1 `2 ) `2 = b5 ) )
theorem Th2: :: YELLOW_3:2
theorem Th3: :: YELLOW_3:3
theorem Th4: :: YELLOW_3:4
theorem Th5: :: YELLOW_3:5
theorem Th6: :: YELLOW_3:6
theorem Th7: :: YELLOW_3:7
theorem Th8: :: YELLOW_3:8
theorem Th9: :: YELLOW_3:9
definition
let c
1, c
2 be
Relation;
func ["c1,c2"] -> Relation means :
Def1:
:: YELLOW_3:def 1
for b
1, b
2 being
set holds
(
[b1,b2] in a
3 iff ex b
3, b
4, b
5, b
6 being
set st
( b
1 = [b3,b4] & b
2 = [b5,b6] &
[b3,b5] in a
1 &
[b4,b6] in a
2 ) );
existence
ex b1 being Relation st
for b2, b3 being set holds
( [b2,b3] in b1 iff ex b4, b5, b6, b7 being set st
( b2 = [b4,b5] & b3 = [b6,b7] & [b4,b6] in c1 & [b5,b7] in c2 ) )
uniqueness
for b1, b2 being Relation holds
( ( for b3, b4 being set holds
( [b3,b4] in b1 iff ex b5, b6, b7, b8 being set st
( b3 = [b5,b6] & b4 = [b7,b8] & [b5,b7] in c1 & [b6,b8] in c2 ) ) ) & ( for b3, b4 being set holds
( [b3,b4] in b2 iff ex b5, b6, b7, b8 being set st
( b3 = [b5,b6] & b4 = [b7,b8] & [b5,b7] in c1 & [b6,b8] in c2 ) ) ) implies b1 = b2 )
end;
:: deftheorem Def1 defines [" YELLOW_3:def 1 :
for b
1, b
2, b
3 being
Relation holds
( b
3 = ["b1,b2"] iff for b
4, b
5 being
set holds
(
[b4,b5] in b
3 iff ex b
6, b
7, b
8, b
9 being
set st
( b
4 = [b6,b7] & b
5 = [b8,b9] &
[b6,b8] in b
1 &
[b7,b9] in b
2 ) ) );
theorem Th10: :: YELLOW_3:10
for b
1, b
2 being
Relationfor b
3 being
set holds
( b
3 in ["b1,b2"] iff (
[((b3 `1 ) `1 ),((b3 `2 ) `1 )] in b
1 &
[((b3 `1 ) `2 ),((b3 `2 ) `2 )] in b
2 & ex b
4, b
5 being
set st b
3 = [b4,b5] & ex b
4, b
5 being
set st b
3 `1 = [b4,b5] & ex b
4, b
5 being
set st b
3 `2 = [b4,b5] ) )
definition
let c
1, c
2, c
3, c
4 be
set ;
let c
5 be
Relation of c
1,c
2;
let c
6 be
Relation of c
3,c
4;
redefine func [" as
["c5,c6"] -> Relation of
[:a1,a3:],
[:a2,a4:];
coherence
["c5,c6"] is Relation of [:c1,c3:],[:c2,c4:]
end;
definition
let c
1, c
2 be
RelStr ;
func [:c1,c2:] -> strict RelStr means :
Def2:
:: YELLOW_3:def 2
( the
carrier of a
3 = [:the carrier of a1,the carrier of a2:] & the
InternalRel of a
3 = ["the InternalRel of a1,the InternalRel of a2"] );
existence
ex b1 being strict RelStr st
( the carrier of b1 = [:the carrier of c1,the carrier of c2:] & the InternalRel of b1 = ["the InternalRel of c1,the InternalRel of c2"] )
uniqueness
for b1, b2 being strict RelStr holds
( the carrier of b1 = [:the carrier of c1,the carrier of c2:] & the InternalRel of b1 = ["the InternalRel of c1,the InternalRel of c2"] & the carrier of b2 = [:the carrier of c1,the carrier of c2:] & the InternalRel of b2 = ["the InternalRel of c1,the InternalRel of c2"] implies b1 = b2 )
;
end;
:: deftheorem Def2 defines [: YELLOW_3:def 2 :
theorem Th11: :: YELLOW_3:11
theorem Th12: :: YELLOW_3:12
theorem Th13: :: YELLOW_3:13
theorem Th14: :: YELLOW_3:14
theorem Th15: :: YELLOW_3:15
theorem Th16: :: YELLOW_3:16
theorem Th17: :: YELLOW_3:17
theorem Th18: :: YELLOW_3:18
theorem Th19: :: YELLOW_3:19
theorem Th20: :: YELLOW_3:20
theorem Th21: :: YELLOW_3:21
theorem Th22: :: YELLOW_3:22
theorem Th23: :: YELLOW_3:23
theorem Th24: :: YELLOW_3:24
theorem Th25: :: YELLOW_3:25
theorem Th26: :: YELLOW_3:26
theorem Th27: :: YELLOW_3:27
theorem Th28: :: YELLOW_3:28
:: deftheorem Def3 defines void YELLOW_3:def 3 :
theorem Th29: :: YELLOW_3:29
theorem Th30: :: YELLOW_3:30
theorem Th31: :: YELLOW_3:31
theorem Th32: :: YELLOW_3:32
theorem Th33: :: YELLOW_3:33
theorem Th34: :: YELLOW_3:34
theorem Th35: :: YELLOW_3:35
theorem Th36: :: YELLOW_3:36
theorem Th37: :: YELLOW_3:37
theorem Th38: :: YELLOW_3:38
theorem Th39: :: YELLOW_3:39
theorem Th40: :: YELLOW_3:40
theorem Th41: :: YELLOW_3:41
theorem Th42: :: YELLOW_3:42
theorem Th43: :: YELLOW_3:43
theorem Th44: :: YELLOW_3:44
theorem Th45: :: YELLOW_3:45
theorem Th46: :: YELLOW_3:46
theorem Th47: :: YELLOW_3:47
theorem Th48: :: YELLOW_3:48
theorem Th49: :: YELLOW_3:49