let X be set ; for EqR1, EqR2, E being Equivalence_Relation of X st E = EqR1 \/ EqR2 holds
for x being set holds
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
let EqR1, EqR2, E be Equivalence_Relation of X; ( E = EqR1 \/ EqR2 implies for x being set holds
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x ) )
assume A1:
E = EqR1 \/ EqR2
; for x being set holds
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
for x being set holds
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
proof
let x be
set ;
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
assume
x in X
;
( Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
assume that A2:
not
Class E,
x = Class EqR1,
x
and A3:
not
Class E,
x = Class EqR2,
x
;
contradiction
consider y being
set such that A4:
( (
y in Class E,
x & not
y in Class EqR1,
x ) or (
y in Class EqR1,
x & not
y in Class E,
x ) )
by A2, TARSKI:2;
then A8:
[y,x] in E
by A4, Th27;
consider z being
set such that A9:
( (
z in Class E,
x & not
z in Class EqR2,
x ) or (
z in Class EqR2,
x & not
z in Class E,
x ) )
by A3, TARSKI:2;
then A13:
[z,x] in E
by A9, Th27;
not
[z,x] in EqR2
by A9, A10, Th27;
then A14:
[z,x] in EqR1
by A1, A13, XBOOLE_0:def 3;
not
[y,x] in EqR1
by A4, A5, Th27;
then A17:
[y,x] in EqR2
by A1, A8, XBOOLE_0:def 3;
[x,z] in E
by A13, Th12;
then
[y,z] in E
by A8, Th13;
hence
contradiction
by A1, A18, A15, XBOOLE_0:def 3;
verum
end;
hence
for x being set holds
( not x in X or Class E,x = Class EqR1,x or Class E,x = Class EqR2,x )
; verum