let X be set ; :: thesis: for i being Function of bool X, bool X st i . X = X & ( for A being Subset of X holds i . A c= A ) & ( for A, B being Subset of X holds i . (A /\ B) = (i . A) /\ (i . B) ) & ( for A being Subset of X holds i . (i . A) = i . A ) holds
for T being TopStruct st the carrier of T = X & the topology of T = rng i holds
( T is TopSpace & ( for A being Subset of T holds Int A = i . A ) )
let c be Function of bool X, bool X; :: thesis: ( c . X = X & ( for A being Subset of X holds c . A c= A ) & ( for A, B being Subset of X holds c . (A /\ B) = (c . A) /\ (c . B) ) & ( for A being Subset of X holds c . (c . A) = c . A ) implies for T being TopStruct st the carrier of T = X & the topology of T = rng c holds
( T is TopSpace & ( for A being Subset of T holds Int A = c . A ) ) )
assume that
A1:
c . X = X
and
A2:
for A being Subset of X holds c . A c= A
and
A3:
for A, B being Subset of X holds c . (A /\ B) = (c . A) /\ (c . B)
and
A4:
for A being Subset of X holds c . (c . A) = c . A
; :: thesis: for T being TopStruct st the carrier of T = X & the topology of T = rng c holds
( T is TopSpace & ( for A being Subset of T holds Int A = c . A ) )
let T be TopStruct ; :: thesis: ( the carrier of T = X & the topology of T = rng c implies ( T is TopSpace & ( for A being Subset of T holds Int A = c . A ) ) )
assume A5:
( the carrier of T = X & the topology of T = rng c )
; :: thesis: ( T is TopSpace & ( for A being Subset of T holds Int A = c . A ) )
A6:
dom c = bool X
by FUNCT_2:def 1;
set F = rng c;
( X = [#] X & {} = {} X )
;
then A7:
X in rng c
by A1, A6, FUNCT_1:def 5;
hence A17:
T is TopSpace
by A5, A7, A8, PRE_TOPC:def 1; :: thesis: for A being Subset of T holds Int A = c . A
let A be Subset of T; :: thesis: Int A = c . A
reconsider B = A, IntA = Int A as Subset of X by A5;
reconsider cB = c . B as Subset of T by A5;
Int A is open
by A17;
then
IntA in rng c
by A5, PRE_TOPC:def 5;
then
ex a being set st
( a in dom c & IntA = c . a )
by FUNCT_1:def 5;
then
( c . IntA = IntA & Int A c= A )
by A4, TOPS_1:44;
hence
Int A c= c . A
by A5, A12; :: according to XBOOLE_0:def 10 :: thesis: c . A c= Int A
cB in rng c
by A6, FUNCT_1:def 5;
then
( cB is open & c . B c= B )
by A2, A5, PRE_TOPC:def 5;
hence
c . A c= Int A
by TOPS_1:56; :: thesis: verum