defpred S1[ set ] means for x, y being set st x in $1 & y in $1 holds
[x,y] in E;
consider Z being set such that
A1:
for x being set holds
( x in Z iff ( x in bool X & S1[x] ) )
from XFAMILY:sch 1();
A2:
for A being set st A c= Z & ( for a, b being set st a in A & b in A holds
a \/ b in Z ) holds
union A in Z
proof
let A be
set ;
( A c= Z & ( for a, b being set st a in A & b in A holds
a \/ b in Z ) implies union A in Z )
assume that A3:
A c= Z
and A4:
for
a,
b being
set st
a in A &
b in A holds
a \/ b in Z
;
union A in Z
A5:
now for x, y being set st x in union A & y in union A holds
[x,y] in Elet x,
y be
set ;
( x in union A & y in union A implies [x,y] in E )assume that A6:
x in union A
and A7:
y in union A
;
[x,y] in Econsider Y1 being
set such that A8:
y in Y1
and A9:
Y1 in A
by A7, TARSKI:def 4;
consider X1 being
set such that A10:
x in X1
and A11:
X1 in A
by A6, TARSKI:def 4;
A12:
x in X1 \/ Y1
by A10, XBOOLE_0:def 3;
A13:
y in X1 \/ Y1
by A8, XBOOLE_0:def 3;
X1 \/ Y1 in Z
by A4, A11, A9;
hence
[x,y] in E
by A1, A12, A13;
verum end;
then
union A c= X
by ZFMISC_1:76;
hence
union A in Z
by A1, A5;
verum
end;
A14:
for a, b being set st a in Z & b c= a holds
b in Z
( S1[ {} ] & {} c= X )
;
then reconsider Z = Z as Coherence_Space by A1, A14, A2, Def1, CLASSES1:def 1;
take
Z
; for a being set holds
( a in Z iff for x, y being set st x in a & y in a holds
[x,y] in E )
let a be set ; ( a in Z iff for x, y being set st x in a & y in a holds
[x,y] in E )
thus
( a in Z implies for x, y being set st x in a & y in a holds
[x,y] in E )
by A1; ( ( for x, y being set st x in a & y in a holds
[x,y] in E ) implies a in Z )
assume A18:
for x, y being set st x in a & y in a holds
[x,y] in E
; a in Z
then
a c= X
by TOLER_1:18, TOLER_1:def 1;
hence
a in Z
by A1, A18; verum