:: ALG_1 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: ALG_1:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: ALG_1:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: ALG_1:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: ALG_1:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def1 defines is_homomorphism ALG_1:def 1 :
:: deftheorem Def2 defines is_monomorphism ALG_1:def 2 :
:: deftheorem Def3 defines is_epimorphism ALG_1:def 3 :
:: deftheorem Def4 defines is_isomorphism ALG_1:def 4 :
:: deftheorem Def5 defines are_isomorphic ALG_1:def 5 :
theorem Th6: :: ALG_1:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: ALG_1:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: ALG_1:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: ALG_1:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: ALG_1:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: ALG_1:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: ALG_1:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def6 defines Image ALG_1:def 6 :
theorem :: ALG_1:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let D be non
empty set ;
let R be
Relation of
D;
canceled;canceled;func ExtendRel R -> Relation of
D * means :
Def9:
:: ALG_1:def 9
for
x,
y being
FinSequence of
D holds
(
[x,y] in it iff (
len x = len y & ( for
n being
Nat st
n in dom x holds
[(x . n),(y . n)] in R ) ) );
existence
ex b1 being Relation of D * st
for x, y being FinSequence of D holds
( [x,y] in b1 iff ( len x = len y & ( for n being Nat st n in dom x holds
[(x . n),(y . n)] in R ) ) )
uniqueness
for b1, b2 being Relation of D * st ( for x, y being FinSequence of D holds
( [x,y] in b1 iff ( len x = len y & ( for n being Nat st n in dom x holds
[(x . n),(y . n)] in R ) ) ) ) & ( for x, y being FinSequence of D holds
( [x,y] in b2 iff ( len x = len y & ( for n being Nat st n in dom x holds
[(x . n),(y . n)] in R ) ) ) ) holds
b1 = b2
end;
:: deftheorem ALG_1:def 7 :
canceled;
:: deftheorem ALG_1:def 8 :
canceled;
:: deftheorem Def9 defines ExtendRel ALG_1:def 9 :
theorem Th18: :: ALG_1:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def10 defines Congruence ALG_1:def 10 :
:: deftheorem Def11 defines is_representatives_FS ALG_1:def 11 :
theorem Th19: :: ALG_1:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def12 defines QuotOp ALG_1:def 12 :
:: deftheorem Def13 defines QuotOpSeq ALG_1:def 13 :
theorem Th20: :: ALG_1:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines QuotUnivAlg ALG_1:def 14 :
definition
let U1 be
Universal_Algebra;
let E be
Congruence of
U1;
func Nat_Hom U1,
E -> Function of
U1,
(QuotUnivAlg U1,E) means :
Def15:
:: ALG_1:def 15
for
u being
Element of
U1 holds
it . u = Class E,
u;
existence
ex b1 being Function of U1,(QuotUnivAlg U1,E) st
for u being Element of U1 holds b1 . u = Class E,u
uniqueness
for b1, b2 being Function of U1,(QuotUnivAlg U1,E) st ( for u being Element of U1 holds b1 . u = Class E,u ) & ( for u being Element of U1 holds b2 . u = Class E,u ) holds
b1 = b2
end;
:: deftheorem Def15 defines Nat_Hom ALG_1:def 15 :
theorem Th21: :: ALG_1:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let U1,
U2 be
Universal_Algebra;
let f be
Function of
U1,
U2;
assume A1:
f is_homomorphism U1,
U2
;
func Cng f -> Congruence of
U1 means :
Def16:
:: ALG_1:def 16
for
a,
b being
Element of
U1 holds
(
[a,b] in it iff
f . a = f . b );
existence
ex b1 being Congruence of U1 st
for a, b being Element of U1 holds
( [a,b] in b1 iff f . a = f . b )
uniqueness
for b1, b2 being Congruence of U1 st ( for a, b being Element of U1 holds
( [a,b] in b1 iff f . a = f . b ) ) & ( for a, b being Element of U1 holds
( [a,b] in b2 iff f . a = f . b ) ) holds
b1 = b2
end;
:: deftheorem Def16 defines Cng ALG_1:def 16 :
definition
let U1,
U2 be
Universal_Algebra;
let f be
Function of
U1,
U2;
assume A1:
f is_homomorphism U1,
U2
;
func HomQuot f -> Function of
(QuotUnivAlg U1,(Cng f)),
U2 means :
Def17:
:: ALG_1:def 17
for
a being
Element of
U1 holds
it . (Class (Cng f),a) = f . a;
existence
ex b1 being Function of (QuotUnivAlg U1,(Cng f)),U2 st
for a being Element of U1 holds b1 . (Class (Cng f),a) = f . a
uniqueness
for b1, b2 being Function of (QuotUnivAlg U1,(Cng f)),U2 st ( for a being Element of U1 holds b1 . (Class (Cng f),a) = f . a ) & ( for a being Element of U1 holds b2 . (Class (Cng f),a) = f . a ) holds
b1 = b2
end;
:: deftheorem Def17 defines HomQuot ALG_1:def 17 :
theorem Th23: :: ALG_1:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: ALG_1:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ALG_1:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)