let X, Y be set ; :: thesis: ( ( X c= [:X,Y:] or X c= [:Y,X:] ) implies X = {} )
assume A1:
( X c= [:X,Y:] or X c= [:Y,X:] )
; :: thesis: X = {}
assume A2:
X <> {}
; :: thesis: contradiction
A3:
now assume A4:
X c= [:X,Y:]
;
:: thesis: contradictionconsider z being
set such that A5:
z in X
by A2, XBOOLE_0:7;
z in X \/ (union X)
by A5, XBOOLE_0:def 3;
then consider Y1 being
set such that A6:
Y1 in X \/ (union X)
and A7:
for
x being
set holds
( not
x in X \/ (union X) or not
x in Y1 )
by TARSKI:7;
then
Y1 in union X
by A6, XBOOLE_0:def 3;
then consider Y2 being
set such that A11:
Y1 in Y2
and A12:
Y2 in X
by TARSKI:def 4;
Y2 in [:X,Y:]
by A4, A12, TARSKI:def 3;
then consider x,
y being
set such that A13:
(
x in X &
y in Y )
and A14:
Y2 = [x,y]
by Def2;
(
Y1 = {x} or
Y1 = {x,y} )
by A11, A14, TARSKI:def 2;
then
(
x in Y1 &
x in X \/ (union X) )
by A13, TARSKI:def 1, TARSKI:def 2, XBOOLE_0:def 3;
hence
contradiction
by A7;
:: thesis: verum end;
hence
contradiction
by A1, A3; :: thesis: verum