:: MODCAT_1 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
:: deftheorem Def1 defines LeftMod_DOMAIN MODCAT_1:def 1 :
:: deftheorem Def2 defines LModMorphism_DOMAIN MODCAT_1:def 2 :
theorem :: MODCAT_1:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: MODCAT_1:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th3: :: MODCAT_1:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def3 defines LModMorphism_DOMAIN MODCAT_1:def 3 :
theorem Th4: :: MODCAT_1:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: MODCAT_1:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let R be
Ring;
let G,
H be
LeftMod of
R;
func Morphs G,
H -> LModMorphism_DOMAIN of
G,
H means :
Def4:
:: MODCAT_1:def 4
for
x being
set holds
(
x in it iff
x is
strict Morphism of
G,
H );
existence
ex b1 being LModMorphism_DOMAIN of G,H st
for x being set holds
( x in b1 iff x is strict Morphism of G,H )
uniqueness
for b1, b2 being LModMorphism_DOMAIN of G,H st ( for x being set holds
( x in b1 iff x is strict Morphism of G,H ) ) & ( for x being set holds
( x in b2 iff x is strict Morphism of G,H ) ) holds
b1 = b2
end;
:: deftheorem Def4 defines Morphs MODCAT_1:def 4 :
:: deftheorem Def5 defines GO MODCAT_1:def 5 :
theorem Th6: :: MODCAT_1:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
R being
Ring for
x,
y1,
y2 being
set st
GO x,
y1,
R &
GO x,
y2,
R holds
y1 = y2
theorem Th7: :: MODCAT_1:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let UN be
Universe;
let R be
Ring;
func LModObjects UN,
R -> set means :
Def6:
:: MODCAT_1:def 6
for
y being
set holds
(
y in it iff ex
x being
set st
(
x in { [G,f] where G is Element of GroupObjects UN, f is Element of Funcs [:the carrier of R,{{} }:],{{} } : verum } &
GO x,
y,
R ) );
existence
ex b1 being set st
for y being set holds
( y in b1 iff ex x being set st
( x in { [G,f] where G is Element of GroupObjects UN, f is Element of Funcs [:the carrier of R,{{} }:],{{} } : verum } & GO x,y,R ) )
uniqueness
for b1, b2 being set st ( for y being set holds
( y in b1 iff ex x being set st
( x in { [G,f] where G is Element of GroupObjects UN, f is Element of Funcs [:the carrier of R,{{} }:],{{} } : verum } & GO x,y,R ) ) ) & ( for y being set holds
( y in b2 iff ex x being set st
( x in { [G,f] where G is Element of GroupObjects UN, f is Element of Funcs [:the carrier of R,{{} }:],{{} } : verum } & GO x,y,R ) ) ) holds
b1 = b2
end;
:: deftheorem Def6 defines LModObjects MODCAT_1:def 6 :
theorem Th8: :: MODCAT_1:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: MODCAT_1:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def7 defines Morphs MODCAT_1:def 7 :
:: deftheorem defines dom' MODCAT_1:def 8 :
:: deftheorem defines cod' MODCAT_1:def 9 :
:: deftheorem defines ID MODCAT_1:def 10 :
definition
let R be
Ring;
let V be
LeftMod_DOMAIN of
R;
func dom V -> Function of
Morphs V,
V means :
Def11:
:: MODCAT_1:def 11
for
f being
Element of
Morphs V holds
it . f = dom' f;
existence
ex b1 being Function of Morphs V,V st
for f being Element of Morphs V holds b1 . f = dom' f
uniqueness
for b1, b2 being Function of Morphs V,V st ( for f being Element of Morphs V holds b1 . f = dom' f ) & ( for f being Element of Morphs V holds b2 . f = dom' f ) holds
b1 = b2
func cod V -> Function of
Morphs V,
V means :
Def12:
:: MODCAT_1:def 12
for
f being
Element of
Morphs V holds
it . f = cod' f;
existence
ex b1 being Function of Morphs V,V st
for f being Element of Morphs V holds b1 . f = cod' f
uniqueness
for b1, b2 being Function of Morphs V,V st ( for f being Element of Morphs V holds b1 . f = cod' f ) & ( for f being Element of Morphs V holds b2 . f = cod' f ) holds
b1 = b2
func ID V -> Function of
V,
Morphs V means :
Def13:
:: MODCAT_1:def 13
for
G being
Element of
V holds
it . G = ID G;
existence
ex b1 being Function of V, Morphs V st
for G being Element of V holds b1 . G = ID G
uniqueness
for b1, b2 being Function of V, Morphs V st ( for G being Element of V holds b1 . G = ID G ) & ( for G being Element of V holds b2 . G = ID G ) holds
b1 = b2
end;
:: deftheorem Def11 defines dom MODCAT_1:def 11 :
:: deftheorem Def12 defines cod MODCAT_1:def 12 :
:: deftheorem Def13 defines ID MODCAT_1:def 13 :
theorem Th10: :: MODCAT_1:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: MODCAT_1:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: MODCAT_1:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let R be
Ring;
let V be
LeftMod_DOMAIN of
R;
func comp V -> PartFunc of
[:(Morphs V),(Morphs V):],
Morphs V means :
Def14:
:: MODCAT_1:def 14
( ( for
g,
f being
Element of
Morphs V holds
(
[g,f] in dom it iff
dom' g = cod' f ) ) & ( for
g,
f being
Element of
Morphs V st
[g,f] in dom it holds
it . [g,f] = g * f ) );
existence
ex b1 being PartFunc of [:(Morphs V),(Morphs V):], Morphs V st
( ( for g, f being Element of Morphs V holds
( [g,f] in dom b1 iff dom' g = cod' f ) ) & ( for g, f being Element of Morphs V st [g,f] in dom b1 holds
b1 . [g,f] = g * f ) )
uniqueness
for b1, b2 being PartFunc of [:(Morphs V),(Morphs V):], Morphs V st ( for g, f being Element of Morphs V holds
( [g,f] in dom b1 iff dom' g = cod' f ) ) & ( for g, f being Element of Morphs V st [g,f] in dom b1 holds
b1 . [g,f] = g * f ) & ( for g, f being Element of Morphs V holds
( [g,f] in dom b2 iff dom' g = cod' f ) ) & ( for g, f being Element of Morphs V st [g,f] in dom b2 holds
b2 . [g,f] = g * f ) holds
b1 = b2
end;
:: deftheorem Def14 defines comp MODCAT_1:def 14 :
theorem Th13: :: MODCAT_1:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let UN be
Universe;
let R be
Ring;
func LModCat UN,
R -> strict CatStr equals :: MODCAT_1:def 15
CatStr(#
(LModObjects UN,R),
(Morphs (LModObjects UN,R)),
(dom (LModObjects UN,R)),
(cod (LModObjects UN,R)),
(comp (LModObjects UN,R)),
(ID (LModObjects UN,R)) #);
coherence
CatStr(# (LModObjects UN,R),(Morphs (LModObjects UN,R)),(dom (LModObjects UN,R)),(cod (LModObjects UN,R)),(comp (LModObjects UN,R)),(ID (LModObjects UN,R)) #) is strict CatStr
;
end;
:: deftheorem defines LModCat MODCAT_1:def 15 :
for
UN being
Universe for
R being
Ring holds
LModCat UN,
R = CatStr(#
(LModObjects UN,R),
(Morphs (LModObjects UN,R)),
(dom (LModObjects UN,R)),
(cod (LModObjects UN,R)),
(comp (LModObjects UN,R)),
(ID (LModObjects UN,R)) #);
theorem Th14: :: MODCAT_1:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: MODCAT_1:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: MODCAT_1:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: MODCAT_1:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: MODCAT_1:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm1:
for UN being Universe
for R being Ring
for f, g being Morphism of (LModCat UN,R) st dom g = cod f holds
( dom (g * f) = dom f & cod (g * f) = cod g )
Lm2:
for UN being Universe
for R being Ring
for f, g, h being Morphism of (LModCat UN,R) st dom h = cod g & dom g = cod f holds
h * (g * f) = (h * g) * f
Lm3:
for UN being Universe
for R being Ring
for b being Object of (LModCat UN,R) holds
( dom (id b) = b & cod (id b) = b & ( for f being Morphism of (LModCat UN,R) st cod f = b holds
(id b) * f = f ) & ( for g being Morphism of (LModCat UN,R) st dom g = b holds
g * (id b) = g ) )