let T be TopSpace; :: thesis: ( T is regular & T is Lindelof implies T is normal )
assume that
A5: T is regular and
A6: T is Lindelof ; :: thesis: T is normal
per cases ( T is empty or not T is empty ) ;
suppose A7: T is empty ; :: thesis: T is normal
let F1, F2 be Subset of T; :: according to PRE_TOPC:def 12 :: thesis: ( not F1 is closed or not F2 is closed or not F1 misses F2 or ex b1, b2 being Element of bool the carrier of T st
( b1 is open & b2 is open & F1 c= b1 & F2 c= b2 & b1 misses b2 ) )

assume that
F1 is closed and
F2 is closed and
A8: F1 misses F2 ; :: thesis: ex b1, b2 being Element of bool the carrier of T st
( b1 is open & b2 is open & F1 c= b1 & F2 c= b2 & b1 misses b2 )

take F1 ; :: thesis: ex b1 being Element of bool the carrier of T st
( F1 is open & b1 is open & F1 c= F1 & F2 c= b1 & F1 misses b1 )

take F2 ; :: thesis: ( F1 is open & F2 is open & F1 c= F1 & F2 c= F2 & F1 misses F2 )
thus ( F1 is open & F2 is open & F1 c= F1 & F2 c= F2 & F1 misses F2 ) by A7, A8; :: thesis: verum
end;
suppose A9: not T is empty ; :: thesis: T is normal
set TOP = the topology of T;
for A being Subset of T
for U being open Subset of T st A is closed & U is open & A c= U holds
ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )
proof
let A be Subset of T; :: thesis: for U being open Subset of T st A is closed & U is open & A c= U holds
ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

let U be open Subset of T; :: thesis: ( A is closed & U is open & A c= U implies ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) ) )

assume that
A10: A is closed and
U is open and
A11: A c= U ; :: thesis: ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

defpred S1[ object , object ] means for p being Point of T st p = c1 holds
ex W being Subset of T st
( W is open & p in W & Cl W c= U & c2 = W );
A12: for x being object st x in A holds
ex y being object st
( y in the topology of T & S1[x,y] )
proof
let x be object ; :: thesis: ( x in A implies ex y being object st
( y in the topology of T & S1[x,y] ) )

assume A13: x in A ; :: thesis: ex y being object st
( y in the topology of T & S1[x,y] )

then reconsider p = x as Point of T ;
U = (U `) ` ;
then consider G1, G2 being Subset of T such that
A14: G1 is open and
A15: G2 is open and
A16: p in G1 and
A17: U ` c= G2 and
A18: G1 misses G2 by A5, A11, A13;
A19: ( Cl (G2 `) = G2 ` & G2 ` c= U ) by A15, A17, PRE_TOPC:22, SUBSET_1:17;
take G1 ; :: thesis: ( G1 in the topology of T & S1[x,G1] )
thus G1 in the topology of T by A14; :: thesis: S1[x,G1]
G1 c= G2 ` by A18, SUBSET_1:23;
then A20: Cl G1 c= Cl (G2 `) by PRE_TOPC:19;
let q be Point of T; :: thesis: ( q = x implies ex W being Subset of T st
( W is open & q in W & Cl W c= U & G1 = W ) )

assume q = x ; :: thesis: ex W being Subset of T st
( W is open & q in W & Cl W c= U & G1 = W )

hence ex W being Subset of T st
( W is open & q in W & Cl W c= U & G1 = W ) by A14, A16, A20, A19, XBOOLE_1:1; :: thesis: verum
end;
consider w being Function of A, the topology of T such that
A21: for x being object st x in A holds
S1[x,w . x] from FUNCT_2:sch 1(A12);
A ` in the topology of T by A10, PRE_TOPC:def 2;
then ( the topology of T is open & {(A `)} c= the topology of T ) by ZFMISC_1:31;
then reconsider RNG = rng w, AA = {(A `)} as open Subset-Family of T by TOPS_2:11, XBOOLE_1:1;
set RngA = RNG \/ AA;
A22: dom w = A by FUNCT_2:def 1;
[#] T c= union (RNG \/ AA)
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in [#] T or x in union (RNG \/ AA) )
assume A23: x in [#] T ; :: thesis: x in union (RNG \/ AA)
per cases ( x in A or not x in A ) ;
suppose A24: x in A ; :: thesis: x in union (RNG \/ AA)
then consider W being Subset of T such that
W is open and
A25: x in W and
Cl W c= U and
A26: w . x = W by A21;
W in rng w by A22, A24, A26, FUNCT_1:def 3;
then W in RNG \/ AA by XBOOLE_0:def 3;
hence x in union (RNG \/ AA) by A25, TARSKI:def 4; :: thesis: verum
end;
end;
end;
then ( RNG \/ AA is open Subset-Family of T & RNG \/ AA is Cover of T ) by SETFAM_1:def 11, TOPS_2:13;
then consider G being Subset-Family of T such that
A29: G c= RNG \/ AA and
A30: G is Cover of T and
A31: G is countable by A6;
A32: [#] T = union G by A30, SETFAM_1:45;
per cases ( G \ AA is empty or not G \ AA is empty ) ;
suppose G \ AA is empty ; :: thesis: ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

then G c= AA by XBOOLE_1:37;
then A33: union G c= union AA by ZFMISC_1:77;
take W = NAT --> ({} T); :: thesis: ( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

rng W = {({} T)} by FUNCOP_1:8;
then A34: ( ({} T) ` = [#] T & Union W = {} T ) by ZFMISC_1:25;
union AA = A ` by ZFMISC_1:25;
then A ` = [#] T by A32, A33;
hence ( A c= Union W & Union W c= U ) by A34, SUBSET_1:42; :: thesis: for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open )

let n be Element of NAT ; :: thesis: ( Cl (W . n) c= U & W . n is open )
W . n = {} T by FUNCOP_1:7;
then Cl (W . n) = {} T by PRE_TOPC:22;
hence ( Cl (W . n) c= U & W . n is open ) by FUNCOP_1:7; :: thesis: verum
end;
suppose A35: not G \ AA is empty ; :: thesis: ex W being sequence of (bool the carrier of T) st
( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

G \ AA is countable by A31, CARD_3:95;
then consider W being sequence of (G \ AA) such that
A36: rng W = G \ AA by A35, CARD_3:96;
reconsider W = W as sequence of (bool the carrier of T) by A35, A36, FUNCT_2:6;
take W ; :: thesis: ( A c= Union W & Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )

thus A c= Union W :: thesis: ( Union W c= U & ( for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open ) ) )
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in A or x in Union W )
assume A37: x in A ; :: thesis: x in Union W
then consider y being set such that
A38: x in y and
A39: y in G by A32, TARSKI:def 4;
not x in A ` by A37, XBOOLE_0:def 5;
then not y in AA by A38, TARSKI:def 1;
then y in rng W by A36, A39, XBOOLE_0:def 5;
then ex n being object st
( n in dom W & W . n = y ) by FUNCT_1:def 3;
hence x in Union W by A38, PROB_1:12; :: thesis: verum
end;
A40: dom W = NAT by FUNCT_2:def 1;
thus Union W c= U :: thesis: for n being Element of NAT holds
( Cl (W . n) c= U & W . n is open )
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in Union W or x in U )
assume x in Union W ; :: thesis: x in U
then consider n being Nat such that
A41: x in W . n by PROB_1:12;
A42: n in NAT by ORDINAL1:def 12;
A43: W . n in G \ AA by A36, A40, FUNCT_1:def 3, A42;
then W . n in G by ZFMISC_1:56;
then A44: ( W . n in RNG or W . n in AA ) by A29, XBOOLE_0:def 3;
W . n <> A ` by A43, ZFMISC_1:56;
then consider xx being object such that
A45: ( xx in dom w & w . xx = W . n ) by A44, FUNCT_1:def 3, TARSKI:def 1;
consider W9 being Subset of T such that
W9 is open and
xx in W9 and
A46: Cl W9 c= U and
A47: W . n = W9 by A21, A22, A45;
W9 c= Cl W9 by PRE_TOPC:18;
then x in Cl W9 by A41, A47;
hence x in U by A46; :: thesis: verum
end;
let n be Element of NAT ; :: thesis: ( Cl (W . n) c= U & W . n is open )
A48: W . n in G \ AA by A36, A40, FUNCT_1:def 3;
then W . n in G by ZFMISC_1:56;
then A49: ( W . n in RNG or W . n in AA ) by A29, XBOOLE_0:def 3;
W . n <> A ` by A48, ZFMISC_1:56;
then consider xx being object such that
A50: ( xx in dom w & w . xx = W . n ) by A49, FUNCT_1:def 3, TARSKI:def 1;
ex W9 being Subset of T st
( W9 is open & xx in W9 & Cl W9 c= U & W . n = W9 ) by A21, A22, A50;
hence ( Cl (W . n) c= U & W . n is open ) ; :: thesis: verum
end;
end;
end;
hence T is normal by A9, NAGATA_1:18; :: thesis: verum
end;
end;