:: RELAT_1 semantic presentation
:: deftheorem Def1 defines Relation-like RELAT_1:def 1 :
theorem Th1: :: RELAT_1:1
canceled;
theorem Th2: :: RELAT_1:2
canceled;
theorem Th3: :: RELAT_1:3
theorem Th4: :: RELAT_1:4
theorem Th5: :: RELAT_1:5
theorem Th6: :: RELAT_1:6
Lemma43:
for x, y being set
for R being Relation st [x,y] in R holds
( x in union (union R) & y in union (union R) )
:: deftheorem Def2 defines = RELAT_1:def 2 :
:: deftheorem Def3 defines c= RELAT_1:def 3 :
theorem Th7: :: RELAT_1:7
canceled;
theorem Th8: :: RELAT_1:8
canceled;
theorem Th9: :: RELAT_1:9
theorem Th10: :: RELAT_1:10
:: deftheorem Def4 defines dom RELAT_1:def 4 :
theorem Th11: :: RELAT_1:11
canceled;
theorem Th12: :: RELAT_1:12
canceled;
theorem Th13: :: RELAT_1:13
theorem Th14: :: RELAT_1:14
theorem Th15: :: RELAT_1:15
:: deftheorem Def5 defines rng RELAT_1:def 5 :
theorem Th16: :: RELAT_1:16
canceled;
theorem Th17: :: RELAT_1:17
canceled;
theorem Th18: :: RELAT_1:18
theorem Th19: :: RELAT_1:19
theorem Th20: :: RELAT_1:20
theorem Th21: :: RELAT_1:21
theorem Th22: :: RELAT_1:22
theorem Th23: :: RELAT_1:23
theorem Th24: :: RELAT_1:24
theorem Th25: :: RELAT_1:25
theorem Th26: :: RELAT_1:26
theorem Th27: :: RELAT_1:27
theorem Th28: :: RELAT_1:28
:: deftheorem Def6 defines field RELAT_1:def 6 :
theorem Th29: :: RELAT_1:29
theorem Th30: :: RELAT_1:30
theorem Th31: :: RELAT_1:31
theorem Th32: :: RELAT_1:32
theorem Th33: :: RELAT_1:33
theorem Th34: :: RELAT_1:34
definition
let R be
Relation;
func c1 ~ -> Relation means :
Def7:
:: RELAT_1:def 7
for
x,
y being
set holds
(
[x,y] in it iff
[y,x] in R );
existence
ex b1 being Relation st
for x, y being set holds
( [x,y] in b1 iff [y,x] in R )
uniqueness
for b1, b2 being Relation st ( for x, y being set holds
( [x,y] in b1 iff [y,x] in R ) ) & ( for x, y being set holds
( [x,y] in b2 iff [y,x] in R ) ) holds
b1 = b2
involutiveness
for b1, b2 being Relation st ( for x, y being set holds
( [x,y] in b1 iff [y,x] in b2 ) ) holds
for x, y being set holds
( [x,y] in b2 iff [y,x] in b1 )
;
end;
:: deftheorem Def7 defines ~ RELAT_1:def 7 :
theorem Th35: :: RELAT_1:35
canceled;
theorem Th36: :: RELAT_1:36
canceled;
theorem Th37: :: RELAT_1:37
theorem Th38: :: RELAT_1:38
theorem Th39: :: RELAT_1:39
theorem Th40: :: RELAT_1:40
theorem Th41: :: RELAT_1:41
definition
let P be
Relation;
let R be
Relation;
func c1 * c2 -> Relation means :
Def8:
:: RELAT_1:def 8
for
x,
y being
set holds
(
[x,y] in it iff ex
z being
set st
(
[x,z] in P &
[z,y] in R ) );
existence
ex b1 being Relation st
for x, y being set holds
( [x,y] in b1 iff ex z being set st
( [x,z] in P & [z,y] in R ) )
uniqueness
for b1, b2 being Relation st ( for x, y being set holds
( [x,y] in b1 iff ex z being set st
( [x,z] in P & [z,y] in R ) ) ) & ( for x, y being set holds
( [x,y] in b2 iff ex z being set st
( [x,z] in P & [z,y] in R ) ) ) holds
b1 = b2
end;
:: deftheorem Def8 defines * RELAT_1:def 8 :
for
P,
R,
b3 being
Relation holds
(
b3 = P * R iff for
x,
y being
set holds
(
[x,y] in b3 iff ex
z being
set st
(
[x,z] in P &
[z,y] in R ) ) );
theorem Th42: :: RELAT_1:42
canceled;
theorem Th43: :: RELAT_1:43
canceled;
theorem Th44: :: RELAT_1:44
theorem Th45: :: RELAT_1:45
theorem Th46: :: RELAT_1:46
theorem Th47: :: RELAT_1:47
theorem Th48: :: RELAT_1:48
theorem Th49: :: RELAT_1:49
theorem Th50: :: RELAT_1:50
theorem Th51: :: RELAT_1:51
theorem Th52: :: RELAT_1:52
theorem Th53: :: RELAT_1:53
theorem Th54: :: RELAT_1:54
theorem Th55: :: RELAT_1:55
theorem Th56: :: RELAT_1:56
theorem Th57: :: RELAT_1:57
canceled;
theorem Th58: :: RELAT_1:58
canceled;
theorem Th59: :: RELAT_1:59
canceled;
theorem Th60: :: RELAT_1:60
theorem Th61: :: RELAT_1:61
canceled;
theorem Th62: :: RELAT_1:62
theorem Th63: :: RELAT_1:63
theorem Th64: :: RELAT_1:64
theorem Th65: :: RELAT_1:65
theorem Th66: :: RELAT_1:66
theorem Th67: :: RELAT_1:67
:: deftheorem Def9 defines non-empty RELAT_1:def 9 :
:: deftheorem Def10 defines id RELAT_1:def 10 :
for
X being
set for
b2 being
Relation holds
(
b2 = id X iff for
x,
y being
set holds
(
[x,y] in b2 iff (
x in X &
x = y ) ) );
theorem Th68: :: RELAT_1:68
canceled;
theorem Th69: :: RELAT_1:69
canceled;
theorem Th70: :: RELAT_1:70
canceled;
theorem Th71: :: RELAT_1:71
theorem Th72: :: RELAT_1:72
theorem Th73: :: RELAT_1:73
theorem Th74: :: RELAT_1:74
theorem Th75: :: RELAT_1:75
theorem Th76: :: RELAT_1:76
theorem Th77: :: RELAT_1:77
theorem Th78: :: RELAT_1:78
theorem Th79: :: RELAT_1:79
theorem Th80: :: RELAT_1:80
theorem Th81: :: RELAT_1:81
theorem Th82: :: RELAT_1:82
definition
let R be
Relation;
let X be
set ;
func c1 | c2 -> Relation means :
Def11:
:: RELAT_1:def 11
for
x,
y being
set holds
(
[x,y] in it iff (
x in X &
[x,y] in R ) );
existence
ex b1 being Relation st
for x, y being set holds
( [x,y] in b1 iff ( x in X & [x,y] in R ) )
uniqueness
for b1, b2 being Relation st ( for x, y being set holds
( [x,y] in b1 iff ( x in X & [x,y] in R ) ) ) & ( for x, y being set holds
( [x,y] in b2 iff ( x in X & [x,y] in R ) ) ) holds
b1 = b2
end;
:: deftheorem Def11 defines | RELAT_1:def 11 :
theorem Th83: :: RELAT_1:83
canceled;
theorem Th84: :: RELAT_1:84
canceled;
theorem Th85: :: RELAT_1:85
canceled;
theorem Th86: :: RELAT_1:86
theorem Th87: :: RELAT_1:87
theorem Th88: :: RELAT_1:88
theorem Th89: :: RELAT_1:89
theorem Th90: :: RELAT_1:90
theorem Th91: :: RELAT_1:91
theorem Th92: :: RELAT_1:92
theorem Th93: :: RELAT_1:93
theorem Th94: :: RELAT_1:94
theorem Th95: :: RELAT_1:95
theorem Th96: :: RELAT_1:96
theorem Th97: :: RELAT_1:97
theorem Th98: :: RELAT_1:98
theorem Th99: :: RELAT_1:99
theorem Th100: :: RELAT_1:100
theorem Th101: :: RELAT_1:101
theorem Th102: :: RELAT_1:102
theorem Th103: :: RELAT_1:103
theorem Th104: :: RELAT_1:104
theorem Th105: :: RELAT_1:105
theorem Th106: :: RELAT_1:106
theorem Th107: :: RELAT_1:107
theorem Th108: :: RELAT_1:108
theorem Th109: :: RELAT_1:109
theorem Th110: :: RELAT_1:110
theorem Th111: :: RELAT_1:111
theorem Th112: :: RELAT_1:112
definition
let Y be
set ;
let R be
Relation;
func c1 | c2 -> Relation means :
Def12:
:: RELAT_1:def 12
for
x,
y being
set holds
(
[x,y] in it iff (
y in Y &
[x,y] in R ) );
existence
ex b1 being Relation st
for x, y being set holds
( [x,y] in b1 iff ( y in Y & [x,y] in R ) )
uniqueness
for b1, b2 being Relation st ( for x, y being set holds
( [x,y] in b1 iff ( y in Y & [x,y] in R ) ) ) & ( for x, y being set holds
( [x,y] in b2 iff ( y in Y & [x,y] in R ) ) ) holds
b1 = b2
end;
:: deftheorem Def12 defines | RELAT_1:def 12 :
for
Y being
set for
R,
b3 being
Relation holds
(
b3 = Y | R iff for
x,
y being
set holds
(
[x,y] in b3 iff (
y in Y &
[x,y] in R ) ) );
theorem Th113: :: RELAT_1:113
canceled;
theorem Th114: :: RELAT_1:114
canceled;
theorem Th115: :: RELAT_1:115
theorem Th116: :: RELAT_1:116
theorem Th117: :: RELAT_1:117
theorem Th118: :: RELAT_1:118
theorem Th119: :: RELAT_1:119
theorem Th120: :: RELAT_1:120
theorem Th121: :: RELAT_1:121
theorem Th122: :: RELAT_1:122
theorem Th123: :: RELAT_1:123
theorem Th124: :: RELAT_1:124
theorem Th125: :: RELAT_1:125
theorem Th126: :: RELAT_1:126
theorem Th127: :: RELAT_1:127
theorem Th128: :: RELAT_1:128
theorem Th129: :: RELAT_1:129
theorem Th130: :: RELAT_1:130
theorem Th131: :: RELAT_1:131
theorem Th132: :: RELAT_1:132
theorem Th133: :: RELAT_1:133
theorem Th134: :: RELAT_1:134
theorem Th135: :: RELAT_1:135
theorem Th136: :: RELAT_1:136
theorem Th137: :: RELAT_1:137
theorem Th138: :: RELAT_1:138
theorem Th139: :: RELAT_1:139
theorem Th140: :: RELAT_1:140
:: deftheorem Def13 defines .: RELAT_1:def 13 :
for
R being
Relation for
X,
b3 being
set holds
(
b3 = R .: X iff for
y being
set holds
(
y in b3 iff ex
x being
set st
(
[x,y] in R &
x in X ) ) );
theorem Th141: :: RELAT_1:141
canceled;
theorem Th142: :: RELAT_1:142
canceled;
theorem Th143: :: RELAT_1:143
theorem Th144: :: RELAT_1:144
theorem Th145: :: RELAT_1:145
theorem Th146: :: RELAT_1:146
theorem Th147: :: RELAT_1:147
theorem Th148: :: RELAT_1:148
theorem Th149: :: RELAT_1:149
theorem Th150: :: RELAT_1:150
theorem Th151: :: RELAT_1:151
theorem Th152: :: RELAT_1:152
theorem Th153: :: RELAT_1:153
theorem Th154: :: RELAT_1:154
theorem Th155: :: RELAT_1:155
theorem Th156: :: RELAT_1:156
theorem Th157: :: RELAT_1:157
theorem Th158: :: RELAT_1:158
theorem Th159: :: RELAT_1:159
theorem Th160: :: RELAT_1:160
theorem Th161: :: RELAT_1:161
theorem Th162: :: RELAT_1:162
theorem Th163: :: RELAT_1:163
:: deftheorem Def14 defines " RELAT_1:def 14 :
for
R being
Relation for
Y,
b3 being
set holds
(
b3 = R " Y iff for
x being
set holds
(
x in b3 iff ex
y being
set st
(
[x,y] in R &
y in Y ) ) );
theorem Th164: :: RELAT_1:164
canceled;
theorem Th165: :: RELAT_1:165
canceled;
theorem Th166: :: RELAT_1:166
theorem Th167: :: RELAT_1:167
theorem Th168: :: RELAT_1:168
theorem Th169: :: RELAT_1:169
theorem Th170: :: RELAT_1:170
theorem Th171: :: RELAT_1:171
theorem Th172: :: RELAT_1:172
theorem Th173: :: RELAT_1:173
theorem Th174: :: RELAT_1:174
theorem Th175: :: RELAT_1:175
theorem Th176: :: RELAT_1:176
theorem Th177: :: RELAT_1:177
theorem Th178: :: RELAT_1:178
theorem Th179: :: RELAT_1:179
theorem Th180: :: RELAT_1:180
theorem Th181: :: RELAT_1:181
theorem Th182: :: RELAT_1:182
theorem Th183: :: RELAT_1:183
:: deftheorem Def15 defines empty-yielding RELAT_1:def 15 :
theorem Th184: :: RELAT_1:184
theorem Th185: :: RELAT_1:185
theorem Th186: :: RELAT_1:186
theorem Th187: :: RELAT_1:187
theorem Th188: :: RELAT_1:188
theorem Th189: :: RELAT_1:189
theorem Th190: :: RELAT_1:190