let T be TopSpace; for A being Subset of T st T is T_1 & A is discrete holds
A is open Subset of (T | (Cl A))
let A be Subset of T; ( T is T_1 & A is discrete implies A is open Subset of (T | (Cl A)) )
assume that
A1:
T is T_1
and
A2:
A is discrete
; A is open Subset of (T | (Cl A))
set TA = T | (Cl A);
A3:
[#] (T | (Cl A)) = Cl A
by PRE_TOPC:def 5;
A4:
A c= Cl A
by PRE_TOPC:18;
per cases
( T | (Cl A) is empty or not T | (Cl A) is empty )
;
suppose
not
T | (Cl A) is
empty
;
A is open Subset of (T | (Cl A))then reconsider TA =
T | (Cl A) as non
empty TopSpace ;
deffunc H1(
Element of
TA)
-> Element of
bool the
carrier of
TA =
{$1};
defpred S1[
set ]
means $1
in A;
consider S being
Subset-Family of
TA such that A5:
S = { H1(x) where x is Element of TA : S1[x] }
from LMOD_7:sch 5();
A6:
S is
open
proof
let B be
Subset of
TA;
TOPS_2:def 1 ( not B in S or B is open )
assume
B in S
;
B is open
then consider y being
Element of
TA such that A7:
B = H1(
y)
and A8:
S1[
y]
by A5;
reconsider x =
y as
Point of
T by A8;
consider G being
Subset of
T such that A9:
G is
open
and A10:
A /\ G = {x}
by A2, A8, TEX_2:26;
reconsider X =
{x} as
Subset of
T by A10;
not
T is
empty
by A7;
then A11:
Cl X = X
by A1, PRE_TOPC:22;
x in {x}
by TARSKI:def 1;
then
(
x in A &
x in G )
by A10, XBOOLE_0:def 4;
then A12:
G /\ (Cl A) <> {}
by A4, XBOOLE_0:def 4;
G /\ (Cl A) c= Cl X
by A9, A10, TOPS_1:13;
then
G /\ (Cl A) = X
by A11, A12, ZFMISC_1:33;
hence
B is
open
by A3, A7, A9, TSP_1:def 1;
verum
end;
union S = A
hence
A is
open Subset of
(T | (Cl A))
by A6, TOPS_2:19;
verum end; end;