:: ALTCAT_4 semantic presentation
theorem Th1: :: ALTCAT_4:1
theorem Th2: :: ALTCAT_4:2
theorem Th3: :: ALTCAT_4:3
theorem Th4: :: ALTCAT_4:4
theorem Th5: :: ALTCAT_4:5
theorem Th6: :: ALTCAT_4:6
theorem Th7: :: ALTCAT_4:7
theorem Th8: :: ALTCAT_4:8
theorem Th9: :: ALTCAT_4:9
theorem Th10: :: ALTCAT_4:10
theorem Th11: :: ALTCAT_4:11
theorem Th12: :: ALTCAT_4:12
theorem Th13: :: ALTCAT_4:13
theorem Th14: :: ALTCAT_4:14
theorem Th15: :: ALTCAT_4:15
theorem Th16: :: ALTCAT_4:16
theorem Th17: :: ALTCAT_4:17
theorem Th18: :: ALTCAT_4:18
theorem Th19: :: ALTCAT_4:19
theorem Th20: :: ALTCAT_4:20
theorem Th21: :: ALTCAT_4:21
theorem Th22: :: ALTCAT_4:22
theorem Th23: :: ALTCAT_4:23
theorem Th24: :: ALTCAT_4:24
theorem Th25: :: ALTCAT_4:25
theorem Th26: :: ALTCAT_4:26
theorem Th27: :: ALTCAT_4:27
theorem Th28: :: ALTCAT_4:28
theorem Th29: :: ALTCAT_4:29
theorem Th30: :: ALTCAT_4:30
theorem Th31: :: ALTCAT_4:31
theorem Th32: :: ALTCAT_4:32
theorem Th33: :: ALTCAT_4:33
E22:
now
let c1 be non
empty transitive AltCatStr ;
let c2,
c3,
c4 be
object of
c1;
assume E23:
the
Arrows of
c1 . c2,
c4 = {}
;
thus
[:(the Arrows of c1 . c3,c4),(the Arrows of c1 . c2,c3):] = {}
proof
assume
[:(the Arrows of c1 . c3,c4),(the Arrows of c1 . c2,c3):] <> {}
;
then consider c5 being
set such that E24:
c5 in [:(the Arrows of c1 . c3,c4),(the Arrows of c1 . c2,c3):]
by XBOOLE_0:def 1;
consider c6,
c7 being
set such that E25:
(
c6 in the
Arrows of
c1 . c3,
c4 &
c7 in the
Arrows of
c1 . c2,
c3 &
c5 = [c6,c7] )
by E24, ZFMISC_1:def 2;
(
c6 in <^c3,c4^> &
c7 in <^c2,c3^> )
by E25;
then
<^c2,c4^> <> {}
by ALTCAT_1:def 4;
hence
contradiction
by E23;
end;
end;
theorem Th34: :: ALTCAT_4:34
theorem Th35: :: ALTCAT_4:35
theorem Th36: :: ALTCAT_4:36
theorem Th37: :: ALTCAT_4:37
theorem Th38: :: ALTCAT_4:38
theorem Th39: :: ALTCAT_4:39
theorem Th40: :: ALTCAT_4:40
definition
let c1 be
category;
func AllMono c1 -> non
empty transitive strict SubCatStr of
a1 means :
Def1:
:: ALTCAT_4:def 1
( the
carrier of
a2 = the
carrier of
a1 & the
Arrows of
a2 cc= the
Arrows of
a1 & ( for
b1,
b2 being
object of
a1 for
b3 being
Morphism of
b1,
b2 holds
(
b3 in the
Arrows of
a2 . b1,
b2 iff (
<^b1,b2^> <> {} &
b3 is
mono ) ) ) );
existence
ex b1 being non empty transitive strict SubCatStr of c1 st
( the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b2, b3 being object of c1
for b4 being Morphism of b2,b3 holds
( b4 in the Arrows of b1 . b2,b3 iff ( <^b2,b3^> <> {} & b4 is mono ) ) ) )
uniqueness
for b1, b2 being non empty transitive strict SubCatStr of c1 st the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b1 . b3,b4 iff ( <^b3,b4^> <> {} & b5 is mono ) ) ) & the carrier of b2 = the carrier of c1 & the Arrows of b2 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b2 . b3,b4 iff ( <^b3,b4^> <> {} & b5 is mono ) ) ) holds
b1 = b2
end;
:: deftheorem Def1 defines AllMono ALTCAT_4:def 1 :
definition
let c1 be
category;
func AllEpi c1 -> non
empty transitive strict SubCatStr of
a1 means :
Def2:
:: ALTCAT_4:def 2
( the
carrier of
a2 = the
carrier of
a1 & the
Arrows of
a2 cc= the
Arrows of
a1 & ( for
b1,
b2 being
object of
a1 for
b3 being
Morphism of
b1,
b2 holds
(
b3 in the
Arrows of
a2 . b1,
b2 iff (
<^b1,b2^> <> {} &
b3 is
epi ) ) ) );
existence
ex b1 being non empty transitive strict SubCatStr of c1 st
( the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b2, b3 being object of c1
for b4 being Morphism of b2,b3 holds
( b4 in the Arrows of b1 . b2,b3 iff ( <^b2,b3^> <> {} & b4 is epi ) ) ) )
uniqueness
for b1, b2 being non empty transitive strict SubCatStr of c1 st the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b1 . b3,b4 iff ( <^b3,b4^> <> {} & b5 is epi ) ) ) & the carrier of b2 = the carrier of c1 & the Arrows of b2 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b2 . b3,b4 iff ( <^b3,b4^> <> {} & b5 is epi ) ) ) holds
b1 = b2
end;
:: deftheorem Def2 defines AllEpi ALTCAT_4:def 2 :
definition
let c1 be
category;
func AllRetr c1 -> non
empty transitive strict SubCatStr of
a1 means :
Def3:
:: ALTCAT_4:def 3
( the
carrier of
a2 = the
carrier of
a1 & the
Arrows of
a2 cc= the
Arrows of
a1 & ( for
b1,
b2 being
object of
a1 for
b3 being
Morphism of
b1,
b2 holds
(
b3 in the
Arrows of
a2 . b1,
b2 iff (
<^b1,b2^> <> {} &
<^b2,b1^> <> {} &
b3 is
retraction ) ) ) );
existence
ex b1 being non empty transitive strict SubCatStr of c1 st
( the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b2, b3 being object of c1
for b4 being Morphism of b2,b3 holds
( b4 in the Arrows of b1 . b2,b3 iff ( <^b2,b3^> <> {} & <^b3,b2^> <> {} & b4 is retraction ) ) ) )
uniqueness
for b1, b2 being non empty transitive strict SubCatStr of c1 st the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b1 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is retraction ) ) ) & the carrier of b2 = the carrier of c1 & the Arrows of b2 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b2 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is retraction ) ) ) holds
b1 = b2
end;
:: deftheorem Def3 defines AllRetr ALTCAT_4:def 3 :
definition
let c1 be
category;
func AllCoretr c1 -> non
empty transitive strict SubCatStr of
a1 means :
Def4:
:: ALTCAT_4:def 4
( the
carrier of
a2 = the
carrier of
a1 & the
Arrows of
a2 cc= the
Arrows of
a1 & ( for
b1,
b2 being
object of
a1 for
b3 being
Morphism of
b1,
b2 holds
(
b3 in the
Arrows of
a2 . b1,
b2 iff (
<^b1,b2^> <> {} &
<^b2,b1^> <> {} &
b3 is
coretraction ) ) ) );
existence
ex b1 being non empty transitive strict SubCatStr of c1 st
( the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b2, b3 being object of c1
for b4 being Morphism of b2,b3 holds
( b4 in the Arrows of b1 . b2,b3 iff ( <^b2,b3^> <> {} & <^b3,b2^> <> {} & b4 is coretraction ) ) ) )
uniqueness
for b1, b2 being non empty transitive strict SubCatStr of c1 st the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b1 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is coretraction ) ) ) & the carrier of b2 = the carrier of c1 & the Arrows of b2 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b2 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is coretraction ) ) ) holds
b1 = b2
end;
:: deftheorem Def4 defines AllCoretr ALTCAT_4:def 4 :
definition
let c1 be
category;
func AllIso c1 -> non
empty transitive strict SubCatStr of
a1 means :
Def5:
:: ALTCAT_4:def 5
( the
carrier of
a2 = the
carrier of
a1 & the
Arrows of
a2 cc= the
Arrows of
a1 & ( for
b1,
b2 being
object of
a1 for
b3 being
Morphism of
b1,
b2 holds
(
b3 in the
Arrows of
a2 . b1,
b2 iff (
<^b1,b2^> <> {} &
<^b2,b1^> <> {} &
b3 is
iso ) ) ) );
existence
ex b1 being non empty transitive strict SubCatStr of c1 st
( the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b2, b3 being object of c1
for b4 being Morphism of b2,b3 holds
( b4 in the Arrows of b1 . b2,b3 iff ( <^b2,b3^> <> {} & <^b3,b2^> <> {} & b4 is iso ) ) ) )
uniqueness
for b1, b2 being non empty transitive strict SubCatStr of c1 st the carrier of b1 = the carrier of c1 & the Arrows of b1 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b1 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is iso ) ) ) & the carrier of b2 = the carrier of c1 & the Arrows of b2 cc= the Arrows of c1 & ( for b3, b4 being object of c1
for b5 being Morphism of b3,b4 holds
( b5 in the Arrows of b2 . b3,b4 iff ( <^b3,b4^> <> {} & <^b4,b3^> <> {} & b5 is iso ) ) ) holds
b1 = b2
end;
:: deftheorem Def5 defines AllIso ALTCAT_4:def 5 :
theorem Th41: :: ALTCAT_4:41
theorem Th42: :: ALTCAT_4:42
theorem Th43: :: ALTCAT_4:43
theorem Th44: :: ALTCAT_4:44
theorem Th45: :: ALTCAT_4:45
theorem Th46: :: ALTCAT_4:46
theorem Th47: :: ALTCAT_4:47
theorem Th48: :: ALTCAT_4:48
theorem Th49: :: ALTCAT_4:49
theorem Th50: :: ALTCAT_4:50
theorem Th51: :: ALTCAT_4:51
theorem Th52: :: ALTCAT_4:52
theorem Th53: :: ALTCAT_4:53
theorem Th54: :: ALTCAT_4:54
theorem Th55: :: ALTCAT_4:55
theorem Th56: :: ALTCAT_4:56
theorem Th57: :: ALTCAT_4:57
theorem Th58: :: ALTCAT_4:58
theorem Th59: :: ALTCAT_4:59