:: XBOOLE_0 semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

scheme :: XBOOLE_0:sch 1
Separation{ F1() -> set , P1[ set ] } :
ex X being set st
for x being set holds
( x in X iff ( x in F1() & P1[x] ) )
proof end;

definition
func {} -> set means :Def1: :: XBOOLE_0:def 1
for x being set holds not x in it;
existence
ex b1 being set st
for x being set holds not x in b1
proof end;
uniqueness
for b1, b2 being set st ( for x being set holds not x in b1 ) & ( for x being set holds not x in b2 ) holds
b1 = b2
proof end;
let X, Y be set ;
func X \/ Y -> set means :Def2: :: XBOOLE_0:def 2
for x being set holds
( x in it iff ( x in X or x in Y ) );
existence
ex b1 being set st
for x being set holds
( x in b1 iff ( x in X or x in Y ) )
proof end;
uniqueness
for b1, b2 being set st ( for x being set holds
( x in b1 iff ( x in X or x in Y ) ) ) & ( for x being set holds
( x in b2 iff ( x in X or x in Y ) ) ) holds
b1 = b2
proof end;
commutativity
for b1, X, Y being set st ( for x being set holds
( x in b1 iff ( x in X or x in Y ) ) ) holds
for x being set holds
( x in b1 iff ( x in Y or x in X ) ) ;
idempotence
for X, x being set holds
( x in X iff ( x in X or x in X ) ) ;
func X /\ Y -> set means :Def3: :: XBOOLE_0:def 3
for x being set holds
( x in it iff ( x in X & x in Y ) );
existence
ex b1 being set st
for x being set holds
( x in b1 iff ( x in X & x in Y ) )
proof end;
uniqueness
for b1, b2 being set st ( for x being set holds
( x in b1 iff ( x in X & x in Y ) ) ) & ( for x being set holds
( x in b2 iff ( x in X & x in Y ) ) ) holds
b1 = b2
proof end;
commutativity
for b1, X, Y being set st ( for x being set holds
( x in b1 iff ( x in X & x in Y ) ) ) holds
for x being set holds
( x in b1 iff ( x in Y & x in X ) ) ;
idempotence
for X, x being set holds
( x in X iff ( x in X & x in X ) ) ;
func X \ Y -> set means :Def4: :: XBOOLE_0:def 4
for x being set holds
( x in it iff ( x in X & not x in Y ) );
existence
ex b1 being set st
for x being set holds
( x in b1 iff ( x in X & not x in Y ) )
proof end;
uniqueness
for b1, b2 being set st ( for x being set holds
( x in b1 iff ( x in X & not x in Y ) ) ) & ( for x being set holds
( x in b2 iff ( x in X & not x in Y ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def1 defines {} XBOOLE_0:def 1 :
for b1 being set holds
( b1 = {} iff for x being set holds not x in b1 );

:: deftheorem Def2 defines \/ XBOOLE_0:def 2 :
for X, Y, b3 being set holds
( b3 = X \/ Y iff for x being set holds
( x in b3 iff ( x in X or x in Y ) ) );

:: deftheorem Def3 defines /\ XBOOLE_0:def 3 :
for X, Y, b3 being set holds
( b3 = X /\ Y iff for x being set holds
( x in b3 iff ( x in X & x in Y ) ) );

:: deftheorem Def4 defines \ XBOOLE_0:def 4 :
for X, Y, b3 being set holds
( b3 = X \ Y iff for x being set holds
( x in b3 iff ( x in X & not x in Y ) ) );

definition
let X be set ;
attr X is empty means :Def5: :: XBOOLE_0:def 5
X = {} ;
let Y be set ;
func X \+\ Y -> set equals :: XBOOLE_0:def 6
(X \ Y) \/ (Y \ X);
correctness
coherence
(X \ Y) \/ (Y \ X) is set ;
;
commutativity
for b1, X, Y being set st b1 = (X \ Y) \/ (Y \ X) holds
b1 = (Y \ X) \/ (X \ Y) ;
pred X misses Y means :Def7: :: XBOOLE_0:def 7
X /\ Y = {} ;
symmetry
for X, Y being set st X /\ Y = {} holds
Y /\ X = {} ;
pred X c< Y means :: XBOOLE_0:def 8
( X c= Y & X <> Y );
irreflexivity
for X being set holds
( not X c= X or not X <> X ) ;
asymmetry
for X, Y being set st X c= Y & X <> Y & Y c= X holds
not Y <> X
proof end;
pred X,Y are_c=-comparable means :: XBOOLE_0:def 9
( X c= Y or Y c= X );
reflexivity
for X being set holds
( X c= X or X c= X ) ;
symmetry
for X, Y being set holds
( ( not X c= Y & not Y c= X ) or Y c= X or X c= Y ) ;
redefine pred X = Y means :: XBOOLE_0:def 10
( X c= Y & Y c= X );
compatibility
( X = Y iff ( X c= Y & Y c= X ) )
proof end;
end;

:: deftheorem Def5 defines empty XBOOLE_0:def 5 :
for X being set holds
( X is empty iff X = {} );

:: deftheorem defines \+\ XBOOLE_0:def 6 :
for X, Y being set holds X \+\ Y = (X \ Y) \/ (Y \ X);

:: deftheorem Def7 defines misses XBOOLE_0:def 7 :
for X, Y being set holds
( X misses Y iff X /\ Y = {} );

:: deftheorem defines c< XBOOLE_0:def 8 :
for X, Y being set holds
( X c< Y iff ( X c= Y & X <> Y ) );

:: deftheorem defines are_c=-comparable XBOOLE_0:def 9 :
for X, Y being set holds
( X,Y are_c=-comparable iff ( X c= Y or Y c= X ) );

:: deftheorem defines = XBOOLE_0:def 10 :
for X, Y being set holds
( X = Y iff ( X c= Y & Y c= X ) );

notation
let X, Y be set ;
antonym X meets Y for X misses Y;
end;

theorem :: XBOOLE_0:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x, X, Y being set holds
( x in X \+\ Y iff ( ( x in X & not x in Y ) or ( x in Y & not x in X ) ) )
proof end;

theorem :: XBOOLE_0:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X, Y, Z being set st ( for x being set holds
( not x in X iff ( x in Y iff x in Z ) ) ) holds
X = Y \+\ Z
proof end;

registration
cluster {} -> empty ;
coherence
{} is empty by Def5;
cluster empty set ;
existence
ex b1 being set st b1 is empty
proof end;
cluster non empty set ;
existence
not for b1 being set holds b1 is empty
proof end;
end;

registration
let D be non empty set ;
let X be set ;
cluster D \/ X -> non empty ;
coherence
not D \/ X is empty
proof end;
cluster X \/ D -> non empty ;
coherence
not X \/ D is empty ;
end;

theorem Th3: :: XBOOLE_0:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X, Y being set holds
( X meets Y iff ex x being set st
( x in X & x in Y ) )
proof end;

theorem :: XBOOLE_0:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X, Y being set holds
( X meets Y iff ex x being set st x in X /\ Y )
proof end;

theorem :: XBOOLE_0:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X, Y, x being set st X misses Y & x in X \/ Y & not ( x in X & not x in Y ) holds
( x in Y & not x in X ) by Def2, Th3;

scheme :: XBOOLE_0:sch 2
Extensionality{ F1() -> set , F2() -> set , P1[ set ] } :
F1() = F2()
provided
A1: for x being set holds
( x in F1() iff P1[x] ) and
A2: for x being set holds
( x in F2() iff P1[x] )
proof end;

scheme :: XBOOLE_0:sch 3
SetEq{ P1[ set ] } :
for X1, X2 being set st ( for x being set holds
( x in X1 iff P1[x] ) ) & ( for x being set holds
( x in X2 iff P1[x] ) ) holds
X1 = X2
proof end;