:: by Czes{\l}aw Byli\'nski

::

:: Received February 1, 1989

:: Copyright (c) 1990-2012 Association of Mizar Users

begin

Lm1: for x, X being set holds

( {x} c= X iff x in X )

proof end;

Lm2: for Y, X, x being set st Y c= X & not x in Y holds

Y c= X \ {x}

proof end;

Lm3: for Y, x being set holds

( Y c= {x} iff ( Y = {} or Y = {x} ) )

proof end;

definition

let X be set ;

defpred S_{1}[ set ] means $1 c= X;

existence

ex b_{1} being set st

for Z being set holds

( Z in b_{1} iff Z c= X )

for b_{1}, b_{2} being set st ( for Z being set holds

( Z in b_{1} iff Z c= X ) ) & ( for Z being set holds

( Z in b_{2} iff Z c= X ) ) holds

b_{1} = b_{2}

end;
defpred S

existence

ex b

for Z being set holds

( Z in b

proof end;

uniqueness for b

( Z in b

( Z in b

b

proof end;

:: deftheorem Def1 defines bool ZFMISC_1:def 1 :

for X being set

for b_{2} being set holds

( b_{2} = bool X iff for Z being set holds

( Z in b_{2} iff Z c= X ) );

for X being set

for b

( b

( Z in b

definition

let X1, X2 be set ;

defpred S_{1}[ set ] means ex x, y being set st

( x in X1 & y in X2 & $1 = [x,y] );

ex b_{1} being set st

for z being set holds

( z in b_{1} iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) )

for b_{1}, b_{2} being set st ( for z being set holds

( z in b_{1} iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) ) ) & ( for z being set holds

( z in b_{2} iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) ) ) holds

b_{1} = b_{2}

end;
defpred S

( x in X1 & y in X2 & $1 = [x,y] );

func [:X1,X2:] -> set means :Def2: :: ZFMISC_1:def 2

for z being set holds

( z in it iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) );

existence for z being set holds

( z in it iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) );

ex b

for z being set holds

( z in b

( x in X1 & y in X2 & z = [x,y] ) )

proof end;

uniqueness for b

( z in b

( x in X1 & y in X2 & z = [x,y] ) ) ) & ( for z being set holds

( z in b

( x in X1 & y in X2 & z = [x,y] ) ) ) holds

b

proof end;

:: deftheorem Def2 defines [: ZFMISC_1:def 2 :

for X1, X2 being set

for b_{3} being set holds

( b_{3} = [:X1,X2:] iff for z being set holds

( z in b_{3} iff ex x, y being set st

( x in X1 & y in X2 & z = [x,y] ) ) );

for X1, X2 being set

for b

( b

( z in b

( x in X1 & y in X2 & z = [x,y] ) ) );

:: deftheorem defines [: ZFMISC_1:def 3 :

for X1, X2, X3 being set holds [:X1,X2,X3:] = [:[:X1,X2:],X3:];

for X1, X2, X3 being set holds [:X1,X2,X3:] = [:[:X1,X2:],X3:];

:: deftheorem defines [: ZFMISC_1:def 4 :

for X1, X2, X3, X4 being set holds [:X1,X2,X3,X4:] = [:[:X1,X2,X3:],X4:];

for X1, X2, X3, X4 being set holds [:X1,X2,X3,X4:] = [:[:X1,X2,X3:],X4:];

begin

::

:: Singleton and unordered pairs.

::

:: Singleton and unordered pairs.

::

Lm4: for x, X being set st {x} \/ X c= X holds

x in X

proof end;

Lm6: for x, X being set st {x} misses X holds

not x in X

proof end;

Lm7: for x, X being set st not x in X holds

{x} misses X

proof end;

Lm8: for X, x being set st X /\ {x} = {x} holds

x in X

proof end;

Lm9: for x, X being set st x in X holds

X /\ {x} = {x}

by XBOOLE_1:28, Lm1;

Lm10: for x, X being set holds

( {x} \ X = {x} iff not x in X )

by Lm6, Lm7, XBOOLE_1:83;

Lm11: for x, X being set holds

( {x} \ X = {} iff x in X )

by Lm1, XBOOLE_1:37;

Lm12: for x, y, X being set holds

( {x,y} \ X = {x} iff ( not x in X & ( y in X or x = y ) ) )

proof end;

Lm13: for X, x being set st X <> {x} & X <> {} holds

ex y being set st

( y in X & y <> x )

proof end;

Lm14: for Z, x1, x2 being set holds

( Z c= {x1,x2} iff ( Z = {} or Z = {x1} or Z = {x2} or Z = {x1,x2} ) )

proof end;

Lm15: for X, A being set st X in A holds

X c= union A

proof end;

Lm16: for X, Y being set holds union {X,Y} = X \/ Y

proof end;

Lm17: for x, y, X, Y being set holds

( [x,y] in [:X,Y:] iff ( x in X & y in Y ) )

proof end;

::

:: Singleton and unordered pairs included in a set.

::

:: Singleton and unordered pairs included in a set.

::

::

:: Set included in a singleton (or unordered pair).

::

:: Set included in a singleton (or unordered pair).

::

theorem :: ZFMISC_1:35

theorem :: ZFMISC_1:36

::

:: Sum of an unordered pair (or a singleton) and a set.

::

:: Sum of an unordered pair (or a singleton) and a set.

::

theorem Th37: :: ZFMISC_1:37

for z, X, Y being set holds

( not {z} = X \/ Y or ( X = {z} & Y = {z} ) or ( X = {} & Y = {z} ) or ( X = {z} & Y = {} ) )

( not {z} = X \/ Y or ( X = {z} & Y = {z} ) or ( X = {} & Y = {z} ) or ( X = {z} & Y = {} ) )

proof end;

theorem :: ZFMISC_1:42

::

:: Intersection of an unordered pair (or a singleton) and a set.

::

:: Intersection of an unordered pair (or a singleton) and a set.

::

theorem :: ZFMISC_1:47

::

:: Difference of an unordered pair (or a singleton) and a set.

::

:: Difference of an unordered pair (or a singleton) and a set.

::

theorem :: ZFMISC_1:59

theorem :: ZFMISC_1:62

theorem :: ZFMISC_1:63

theorem :: ZFMISC_1:65

for x, y, X being set holds

( {x,y} \ X = {} or {x,y} \ X = {x} or {x,y} \ X = {y} or {x,y} \ X = {x,y} )

( {x,y} \ X = {} or {x,y} \ X = {x} or {x,y} \ X = {y} or {x,y} \ X = {x,y} )

proof end;

::

:: Power Set.

::

:: Power Set.

::

::

:: Union of a set.

::

:: Union of a set.

::

theorem :: ZFMISC_1:83

for A, B being set st ( for X, Y being set st X <> Y & X in A \/ B & Y in A \/ B holds

X misses Y ) holds

union (A /\ B) = (union A) /\ (union B)

X misses Y ) holds

union (A /\ B) = (union A) /\ (union B)

proof end;

::

:: Cartesian product.

::

:: Cartesian product.

::

theorem Th84: :: ZFMISC_1:84

for A, X, Y, z being set st A c= [:X,Y:] & z in A holds

ex x, y being set st

( x in X & y in Y & z = [x,y] )

ex x, y being set st

( x in X & y in Y & z = [x,y] )

proof end;

theorem Th85: :: ZFMISC_1:85

for z, X1, Y1, X2, Y2 being set st z in [:X1,Y1:] /\ [:X2,Y2:] holds

ex x, y being set st

( z = [x,y] & x in X1 /\ X2 & y in Y1 /\ Y2 )

ex x, y being set st

( z = [x,y] & x in X1 /\ X2 & y in Y1 /\ Y2 )

proof end;

theorem :: ZFMISC_1:87

theorem :: ZFMISC_1:89

for X1, Y1, X2, Y2 being set st ( for x, y being set holds

( [x,y] in [:X1,Y1:] iff [x,y] in [:X2,Y2:] ) ) holds

[:X1,Y1:] = [:X2,Y2:]

( [x,y] in [:X1,Y1:] iff [x,y] in [:X2,Y2:] ) ) holds

[:X1,Y1:] = [:X2,Y2:]

proof end;

Lm18: for A, X1, Y1, B, X2, Y2 being set st A c= [:X1,Y1:] & B c= [:X2,Y2:] & ( for x, y being set holds

( [x,y] in A iff [x,y] in B ) ) holds

A = B

proof end;

Lm19: for A, B being set st ( for z being set st z in A holds

ex x, y being set st z = [x,y] ) & ( for z being set st z in B holds

ex x, y being set st z = [x,y] ) & ( for x, y being set holds

( [x,y] in A iff [x,y] in B ) ) holds

A = B

proof end;

Lm20: for z, X, Y being set st z in [:X,Y:] holds

ex x, y being set st [x,y] = z

proof end;

theorem Th97: :: ZFMISC_1:97

for X, Y, Z being set holds

( [:(X \/ Y),Z:] = [:X,Z:] \/ [:Y,Z:] & [:Z,(X \/ Y):] = [:Z,X:] \/ [:Z,Y:] )

( [:(X \/ Y),Z:] = [:X,Z:] \/ [:Y,Z:] & [:Z,(X \/ Y):] = [:Z,X:] \/ [:Z,Y:] )

proof end;

theorem :: ZFMISC_1:98

for X1, X2, Y1, Y2 being set holds [:(X1 \/ X2),(Y1 \/ Y2):] = (([:X1,Y1:] \/ [:X1,Y2:]) \/ [:X2,Y1:]) \/ [:X2,Y2:]

proof end;

theorem :: ZFMISC_1:99

for X, Y, Z being set holds

( [:(X /\ Y),Z:] = [:X,Z:] /\ [:Y,Z:] & [:Z,(X /\ Y):] = [:Z,X:] /\ [:Z,Y:] )

( [:(X /\ Y),Z:] = [:X,Z:] /\ [:Y,Z:] & [:Z,(X /\ Y):] = [:Z,X:] /\ [:Z,Y:] )

proof end;

theorem Th102: :: ZFMISC_1:102

for X, Y, Z being set holds

( [:(X \ Y),Z:] = [:X,Z:] \ [:Y,Z:] & [:Z,(X \ Y):] = [:Z,X:] \ [:Z,Y:] )

( [:(X \ Y),Z:] = [:X,Z:] \ [:Y,Z:] & [:Z,(X \ Y):] = [:Z,X:] \ [:Z,Y:] )

proof end;

theorem :: ZFMISC_1:107

theorem :: ZFMISC_1:108

for x, y, X, Y being set st x <> y holds

( [:{x},X:] misses [:{y},Y:] & [:X,{x}:] misses [:Y,{y}:] )

( [:{x},X:] misses [:{y},Y:] & [:X,{x}:] misses [:Y,{y}:] )

proof end;

theorem :: ZFMISC_1:109

for x, y, X being set holds

( [:{x,y},X:] = [:{x},X:] \/ [:{y},X:] & [:X,{x,y}:] = [:X,{x}:] \/ [:X,{y}:] )

( [:{x,y},X:] = [:{x},X:] \/ [:{y},X:] & [:X,{x,y}:] = [:X,{x}:] \/ [:X,{y}:] )

proof end;

theorem Th110: :: ZFMISC_1:110

for X1, Y1, X2, Y2 being set st X1 <> {} & Y1 <> {} & [:X1,Y1:] = [:X2,Y2:] holds

( X1 = X2 & Y1 = Y2 )

( X1 = X2 & Y1 = Y2 )

proof end;

theorem :: ZFMISC_1:112

for N being set ex M being set st

( N in M & ( for X, Y being set st X in M & Y c= X holds

Y in M ) & ( for X being set st X in M holds

bool X in M ) & ( for X being set holds

( not X c= M or X,M are_equipotent or X in M ) ) )

( N in M & ( for X, Y being set st X in M & Y c= X holds

Y in M ) & ( for X being set st X in M holds

bool X in M ) & ( for X being set holds

( not X c= M or X,M are_equipotent or X in M ) ) )

proof end;

theorem :: ZFMISC_1:113

for e, X1, Y1, X2, Y2 being set st e in [:X1,Y1:] & e in [:X2,Y2:] holds

e in [:(X1 /\ X2),(Y1 /\ Y2):]

e in [:(X1 /\ X2),(Y1 /\ Y2):]

proof end;

begin

:: from BORSUK_1

theorem Th114: :: ZFMISC_1:114

for X1, X2, Y1, Y2 being set st [:X1,X2:] c= [:Y1,Y2:] & [:X1,X2:] <> {} holds

( X1 c= Y1 & X2 c= Y2 )

( X1 c= Y1 & X2 c= Y2 )

proof end;

:: from ALTCAT_1

theorem :: ZFMISC_1:115

for A being non empty set

for B, C, D being set st ( [:A,B:] c= [:C,D:] or [:B,A:] c= [:D,C:] ) holds

B c= D

for B, C, D being set st ( [:A,B:] c= [:C,D:] or [:B,A:] c= [:D,C:] ) holds

B c= D

proof end;

:: from WAYBEL18, 2006.01.06, A.T.

theorem :: ZFMISC_1:118

for x, y, z, Z being set holds

( Z c= {x,y,z} iff ( Z = {} or Z = {x} or Z = {y} or Z = {z} or Z = {x,y} or Z = {y,z} or Z = {x,z} or Z = {x,y,z} ) )

( Z c= {x,y,z} iff ( Z = {} or Z = {x} or Z = {y} or Z = {z} or Z = {x,y} or Z = {y,z} or Z = {x,z} or Z = {x,y,z} ) )

proof end;

:: from PARTFUN1, 2006.12.05, A.T.

theorem :: ZFMISC_1:119

for N, M, X1, Y1, X2, Y2 being set st N c= [:X1,Y1:] & M c= [:X2,Y2:] holds

N \/ M c= [:(X1 \/ X2),(Y1 \/ Y2):]

N \/ M c= [:(X1 \/ X2),(Y1 \/ Y2):]

proof end;

Lm21: for x, y, X being set st not x in X & not y in X holds

{x,y} misses X

proof end;

:: from INCPROJ, 2007.01.18. AK

:: deftheorem defines are_mutually_different ZFMISC_1:def 5 :

for x1, x2, x3 being set holds

( x1,x2,x3 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x2 <> x3 ) );

for x1, x2, x3 being set holds

( x1,x2,x3 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x2 <> x3 ) );

definition

let x1, x2, x3, x4 be set ;

end;
pred x1,x2,x3,x4 are_mutually_different means :: ZFMISC_1:def 6

( x1 <> x2 & x1 <> x3 & x1 <> x4 & x2 <> x3 & x2 <> x4 & x3 <> x4 );

( x1 <> x2 & x1 <> x3 & x1 <> x4 & x2 <> x3 & x2 <> x4 & x3 <> x4 );

:: deftheorem defines are_mutually_different ZFMISC_1:def 6 :

for x1, x2, x3, x4 being set holds

( x1,x2,x3,x4 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x2 <> x3 & x2 <> x4 & x3 <> x4 ) );

for x1, x2, x3, x4 being set holds

( x1,x2,x3,x4 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x2 <> x3 & x2 <> x4 & x3 <> x4 ) );

:: from CARD_2, 2007.01.18. AK

:: deftheorem defines are_mutually_different ZFMISC_1:def 7 :

for x1, x2, x3, x4, x5 being set holds

( x1,x2,x3,x4,x5 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x3 <> x4 & x3 <> x5 & x4 <> x5 ) );

for x1, x2, x3, x4, x5 being set holds

( x1,x2,x3,x4,x5 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x3 <> x4 & x3 <> x5 & x4 <> x5 ) );

:: from BORSUK_5, 2007.01.18. AK

:: deftheorem defines are_mutually_different ZFMISC_1:def 8 :

for x1, x2, x3, x4, x5, x6 being set holds

( x1,x2,x3,x4,x5,x6 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x4 <> x5 & x4 <> x6 & x5 <> x6 ) );

for x1, x2, x3, x4, x5, x6 being set holds

( x1,x2,x3,x4,x5,x6 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x4 <> x5 & x4 <> x6 & x5 <> x6 ) );

definition

let x1, x2, x3, x4, x5, x6, x7 be set ;

end;
pred x1,x2,x3,x4,x5,x6,x7 are_mutually_different means :: ZFMISC_1:def 9

( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x1 <> x7 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x2 <> x7 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x3 <> x7 & x4 <> x5 & x4 <> x6 & x4 <> x7 & x5 <> x6 & x5 <> x7 & x6 <> x7 );

( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x1 <> x7 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x2 <> x7 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x3 <> x7 & x4 <> x5 & x4 <> x6 & x4 <> x7 & x5 <> x6 & x5 <> x7 & x6 <> x7 );

:: deftheorem defines are_mutually_different ZFMISC_1:def 9 :

for x1, x2, x3, x4, x5, x6, x7 being set holds

( x1,x2,x3,x4,x5,x6,x7 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x1 <> x7 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x2 <> x7 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x3 <> x7 & x4 <> x5 & x4 <> x6 & x4 <> x7 & x5 <> x6 & x5 <> x7 & x6 <> x7 ) );

for x1, x2, x3, x4, x5, x6, x7 being set holds

( x1,x2,x3,x4,x5,x6,x7 are_mutually_different iff ( x1 <> x2 & x1 <> x3 & x1 <> x4 & x1 <> x5 & x1 <> x6 & x1 <> x7 & x2 <> x3 & x2 <> x4 & x2 <> x5 & x2 <> x6 & x2 <> x7 & x3 <> x4 & x3 <> x5 & x3 <> x6 & x3 <> x7 & x4 <> x5 & x4 <> x6 & x4 <> x7 & x5 <> x6 & x5 <> x7 & x6 <> x7 ) );

:: missing, 2007.02.11, A.T.

:: missing, 2008.03.22, A.T.

theorem :: ZFMISC_1:123

:: comp. REALSET1, 2008.07.05, A.T.

:: deftheorem Def10 defines trivial ZFMISC_1:def 10 :

for X being set holds

( X is trivial iff for x, y being set st x in X & y in X holds

x = y );

for X being set holds

( X is trivial iff for x, y being set st x in X & y in X holds

x = y );

registration
end;

:: from SPRECT_3, 2008.09.30, A.T.

:: from SPRECT_2, 2008.09.30, A.T.

theorem :: ZFMISC_1:126

for A, B being set st ( for x, y being set st x in A & y in B holds

x misses y ) holds

union A misses union B

x misses y ) holds

union A misses union B

proof end;

:: from BORSUK_3, 2009.01.24, A.T.

registration
end;

registration
end;

:: new, 2009.08.26, A.T

registration
end;

:: from JORDAN16, 2011.04.27, A.T.

:: Lemma from RELAT_1, FUNCT_4

:: Empty set.

::