:: SETFAM_1 semantic presentation
:: deftheorem Def1 defines meet SETFAM_1:def 1 :
for
X being
set for
b2 being
set holds
( (
X <> {} implies (
b2 = meet X iff for
x being
set holds
(
x in b2 iff for
Y being
set st
Y in X holds
x in Y ) ) ) & ( not
X <> {} implies (
b2 = meet X iff
b2 = {} ) ) );
theorem Th1: :: SETFAM_1:1
canceled;
theorem Th2: :: SETFAM_1:2
theorem Th3: :: SETFAM_1:3
theorem Th4: :: SETFAM_1:4
theorem Th5: :: SETFAM_1:5
theorem Th6: :: SETFAM_1:6
theorem Th7: :: SETFAM_1:7
theorem Th8: :: SETFAM_1:8
theorem Th9: :: SETFAM_1:9
theorem Th10: :: SETFAM_1:10
theorem Th11: :: SETFAM_1:11
theorem Th12: :: SETFAM_1:12
:: deftheorem Def2 defines is_finer_than SETFAM_1:def 2 :
:: deftheorem Def3 defines is_coarser_than SETFAM_1:def 3 :
theorem Th13: :: SETFAM_1:13
canceled;
theorem Th14: :: SETFAM_1:14
canceled;
theorem Th15: :: SETFAM_1:15
canceled;
theorem Th16: :: SETFAM_1:16
canceled;
theorem Th17: :: SETFAM_1:17
theorem Th18: :: SETFAM_1:18
theorem Th19: :: SETFAM_1:19
theorem Th20: :: SETFAM_1:20
theorem Th21: :: SETFAM_1:21
theorem Th22: :: SETFAM_1:22
canceled;
theorem Th23: :: SETFAM_1:23
theorem Th24: :: SETFAM_1:24
theorem Th25: :: SETFAM_1:25
definition
let SFX be
set ;
let SFY be
set ;
func UNION c1,
c2 -> set means :
Def4:
:: SETFAM_1:def 4
for
Z being
set holds
(
Z in it iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X \/ Y ) );
existence
ex b1 being set st
for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \/ Y ) )
uniqueness
for b1, b2 being set st ( for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \/ Y ) ) ) & ( for Z being set holds
( Z in b2 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \/ Y ) ) ) holds
b1 = b2
commutativity
for b1 being set
for SFX, SFY being set st ( for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \/ Y ) ) ) holds
for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFY & Y in SFX & Z = X \/ Y ) )
func INTERSECTION c1,
c2 -> set means :
Def5:
:: SETFAM_1:def 5
for
Z being
set holds
(
Z in it iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X /\ Y ) );
existence
ex b1 being set st
for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X /\ Y ) )
uniqueness
for b1, b2 being set st ( for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X /\ Y ) ) ) & ( for Z being set holds
( Z in b2 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X /\ Y ) ) ) holds
b1 = b2
commutativity
for b1 being set
for SFX, SFY being set st ( for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X /\ Y ) ) ) holds
for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFY & Y in SFX & Z = X /\ Y ) )
func DIFFERENCE c1,
c2 -> set means :
Def6:
:: SETFAM_1:def 6
for
Z being
set holds
(
Z in it iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X \ Y ) );
existence
ex b1 being set st
for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \ Y ) )
uniqueness
for b1, b2 being set st ( for Z being set holds
( Z in b1 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \ Y ) ) ) & ( for Z being set holds
( Z in b2 iff ex X, Y being set st
( X in SFX & Y in SFY & Z = X \ Y ) ) ) holds
b1 = b2
end;
:: deftheorem Def4 defines UNION SETFAM_1:def 4 :
for
SFX,
SFY being
set for
b3 being
set holds
(
b3 = UNION SFX,
SFY iff for
Z being
set holds
(
Z in b3 iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X \/ Y ) ) );
:: deftheorem Def5 defines INTERSECTION SETFAM_1:def 5 :
for
SFX,
SFY being
set for
b3 being
set holds
(
b3 = INTERSECTION SFX,
SFY iff for
Z being
set holds
(
Z in b3 iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X /\ Y ) ) );
:: deftheorem Def6 defines DIFFERENCE SETFAM_1:def 6 :
for
SFX,
SFY being
set for
b3 being
set holds
(
b3 = DIFFERENCE SFX,
SFY iff for
Z being
set holds
(
Z in b3 iff ex
X,
Y being
set st
(
X in SFX &
Y in SFY &
Z = X \ Y ) ) );
theorem Th26: :: SETFAM_1:26
canceled;
theorem Th27: :: SETFAM_1:27
canceled;
theorem Th28: :: SETFAM_1:28
canceled;
theorem Th29: :: SETFAM_1:29
theorem Th30: :: SETFAM_1:30
theorem Th31: :: SETFAM_1:31
theorem Th32: :: SETFAM_1:32
canceled;
theorem Th33: :: SETFAM_1:33
canceled;
theorem Th34: :: SETFAM_1:34
theorem Th35: :: SETFAM_1:35
theorem Th36: :: SETFAM_1:36
theorem Th37: :: SETFAM_1:37
theorem Th38: :: SETFAM_1:38
theorem Th39: :: SETFAM_1:39
theorem Th40: :: SETFAM_1:40
theorem Th41: :: SETFAM_1:41
theorem Th42: :: SETFAM_1:42
canceled;
theorem Th43: :: SETFAM_1:43
canceled;
theorem Th44: :: SETFAM_1:44
:: deftheorem Def7 SETFAM_1:def 7 :
canceled;
:: deftheorem Def8 defines COMPLEMENT SETFAM_1:def 8 :
theorem Th45: :: SETFAM_1:45
canceled;
theorem Th46: :: SETFAM_1:46
theorem Th47: :: SETFAM_1:47
theorem Th48: :: SETFAM_1:48
theorem Th49: :: SETFAM_1:49
theorem Th50: :: SETFAM_1:50
canceled;
theorem Th51: :: SETFAM_1:51
theorem Th52: :: SETFAM_1:52
theorem Th53: :: SETFAM_1:53
theorem Th54: :: SETFAM_1:54
theorem Th55: :: SETFAM_1:55
:: deftheorem Def9 defines with_non-empty_elements SETFAM_1:def 9 :
registration
let A be non
empty set ;
cluster {a1} -> with_non-empty_elements ;
coherence
{A} is with_non-empty_elements
let B be non
empty set ;
cluster {a1,a2} -> with_non-empty_elements ;
coherence
{A,B} is with_non-empty_elements
let C be non
empty set ;
cluster {a1,a2,a3} -> with_non-empty_elements ;
coherence
{A,B,C} is with_non-empty_elements
let D be non
empty set ;
cluster {a1,a2,a3,a4} -> with_non-empty_elements ;
coherence
{A,B,C,D} is with_non-empty_elements
let E be non
empty set ;
cluster {a1,a2,a3,a4,a5} -> with_non-empty_elements ;
coherence
{A,B,C,D,E} is with_non-empty_elements
let F be non
empty set ;
cluster {a1,a2,a3,a4,a5,a6} -> with_non-empty_elements ;
coherence
{A,B,C,D,E,F} is with_non-empty_elements
let G be non
empty set ;
cluster {a1,a2,a3,a4,a5,a6,a7} -> with_non-empty_elements ;
coherence
{A,B,C,D,E,F,G} is with_non-empty_elements
let H be non
empty set ;
cluster {a1,a2,a3,a4,a5,a6,a7,a8} -> with_non-empty_elements ;
coherence
{A,B,C,D,E,F,G,H} is with_non-empty_elements
let I be non
empty set ;
cluster {a1,a2,a3,a4,a5,a6,a7,a8,a9} -> with_non-empty_elements ;
coherence
{A,B,C,D,E,F,G,H,I} is with_non-empty_elements
let J be non
empty set ;
cluster {a1,a2,a3,a4,a5,a6,a7,a8,a9,a10} -> with_non-empty_elements ;
coherence
{A,B,C,D,E,F,G,H,I,J} is with_non-empty_elements
end;
theorem Th56: :: SETFAM_1:56
theorem Th57: :: SETFAM_1:57
:: deftheorem Def10 defines Intersect SETFAM_1:def 10 :
theorem Th58: :: SETFAM_1:58
theorem Th59: :: SETFAM_1:59
:: deftheorem Def11 defines empty-membered SETFAM_1:def 11 :