let T be non empty TopSpace; :: thesis: ( ( T is regular & T is T_1 & ex Bn being FamilySequence of T st Bn is Basis_sigma_locally_finite ) iff T is metrizable )
thus ( T is regular & T is T_1 & ex Bn being FamilySequence of T st Bn is Basis_sigma_locally_finite implies T is metrizable ) :: thesis: ( T is metrizable implies ( T is regular & T is T_1 & ex Bn being FamilySequence of T st Bn is Basis_sigma_locally_finite ) )
proof
set cTT = the carrier of [:T,T:];
set bcT = bool the carrier of T;
set cT = the carrier of T;
assume that
A1: T is regular and
A2: T is T_1 and
A3: ex Bn being FamilySequence of T st Bn is Basis_sigma_locally_finite ; :: thesis: T is metrizable
set Fun = Funcs ( the carrier of [:T,T:],REAL);
consider Bn being FamilySequence of T such that
A4: Bn is Basis_sigma_locally_finite by A3;
defpred S1[ set , set , RealMap of [:T,T:]] means ex pmet being Function of [: the carrier of T, the carrier of T:],REAL st
( $3 = pmet & $3 is continuous & pmet is_a_pseudometric_of the carrier of T & ( for p, q being Point of T holds
( pmet . [p,q] <= 1 & ( for p, q being Point of T st ex A, B being Subset of T st
( A is open & B is open & A in Bn . $2 & B in Bn . $1 & p in A & Cl A c= B & not q in B ) holds
pmet . [p,q] = 1 ) ) ) );
defpred S2[ set , set ] means ex F being RealMap of [:T,T:] st
( F = $2 & ( for n, m being Element of NAT st (PairFunc ") . $1 = [n,m] holds
S1[n,m,F] ) );
A5: Union Bn is Basis of T by A4, NAGATA_1:def 6;
A6: Bn is sigma_locally_finite by A4, NAGATA_1:def 6;
A7: for n, m being Element of NAT ex pmet9 being RealMap of [:T,T:] st S1[n,m,pmet9]
proof
defpred S3[ Element of Funcs ( the carrier of [:T,T:],REAL), Element of Funcs ( the carrier of [:T,T:],REAL), set ] means $1 + $2 = $3;
defpred S4[ RealMap of T, Function] means for p, q being Point of T holds $2 . (p,q) = abs (($1 . p) - ($1 . q));
let n, m be Element of NAT ; :: thesis: ex pmet9 being RealMap of [:T,T:] st S1[n,m,pmet9]
deffunc H1( set ) -> set = union { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= $1 ) } ;
set Bnn = Bn . n;
deffunc H2( Subset of T) -> set = { Q where Q is Subset of T : ( Q in Bn . n & Q meets $1 ) } ;
defpred S5[ set , Subset of T] means ( $1 in $2 & $2 is open & H2($2) is finite );
A8: for A being set st A in bool the carrier of T holds
H1(A) in bool the carrier of T
proof
let A be set ; :: thesis: ( A in bool the carrier of T implies H1(A) in bool the carrier of T )
assume A in bool the carrier of T ; :: thesis: H1(A) in bool the carrier of T
set Um = { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } ;
now
let uv be set ; :: thesis: ( uv in H1(A) implies uv in the carrier of T )
assume uv in H1(A) ; :: thesis: uv in the carrier of T
then consider v being set such that
A9: uv in v and
A10: v in { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } by TARSKI:def 4;
ex B being Subset of T st
( v = B & B in Bn . m & Cl B c= A ) by A10;
hence uv in the carrier of T by A9; :: thesis: verum
end;
then H1(A) c= the carrier of T by TARSKI:def 3;
hence H1(A) in bool the carrier of T ; :: thesis: verum
end;
consider Vm being Function of (bool the carrier of T),(bool the carrier of T) such that
A11: for A being set st A in bool the carrier of T holds
Vm . A = H1(A) from FUNCT_2:sch 2(A8);
defpred S6[ set , set ] means ex F being RealMap of T ex S being Subset of T st
( S = $1 & F = $2 & F is continuous & ( for p being Point of T holds
( 0 <= F . p & F . p <= 1 & ( p in S ` implies F . p = 0 ) & ( p in Cl (Vm . S) implies F . p = 1 ) ) ) );
A12: Bn . m is locally_finite by A6, NAGATA_1:def 3;
A13: for A being Subset of T holds Cl (Vm . A) c= A
proof
let A be Subset of T; :: thesis: Cl (Vm . A) c= A
set VmA = { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } ;
{ Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } c= bool the carrier of T
proof
let B be set ; :: according to TARSKI:def 3 :: thesis: ( not B in { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } or B in bool the carrier of T )
assume B in { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } ; :: thesis: B in bool the carrier of T
then ex C being Subset of T st
( B = C & C in Bn . m & Cl C c= A ) ;
hence B in bool the carrier of T ; :: thesis: verum
end;
then reconsider VmA = { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= A ) } as Subset-Family of T ;
A14: union (clf VmA) c= A
proof
let ClBu be set ; :: according to TARSKI:def 3 :: thesis: ( not ClBu in union (clf VmA) or ClBu in A )
assume ClBu in union (clf VmA) ; :: thesis: ClBu in A
then consider ClB being set such that
A15: ClBu in ClB and
A16: ClB in clf VmA by TARSKI:def 4;
reconsider ClB = ClB as Subset of T by A16;
consider B being Subset of T such that
A17: Cl B = ClB and
A18: B in VmA by A16, PCOMPS_1:def 2;
ex C being Subset of T st
( B = C & C in Bn . m & Cl C c= A ) by A18;
hence ClBu in A by A15, A17; :: thesis: verum
end;
VmA c= Bn . m
proof
let B be set ; :: according to TARSKI:def 3 :: thesis: ( not B in VmA or B in Bn . m )
assume B in VmA ; :: thesis: B in Bn . m
then ex C being Subset of T st
( B = C & C in Bn . m & Cl C c= A ) ;
hence B in Bn . m ; :: thesis: verum
end;
then Cl (union VmA) = union (clf VmA) by A12, PCOMPS_1:9, PCOMPS_1:20;
hence Cl (Vm . A) c= A by A11, A14; :: thesis: verum
end;
A19: for A being set st A in Bn . n holds
ex f being set st
( f in Funcs ( the carrier of T,REAL) & S6[A,f] )
proof
let A be set ; :: thesis: ( A in Bn . n implies ex f being set st
( f in Funcs ( the carrier of T,REAL) & S6[A,f] ) )

assume A in Bn . n ; :: thesis: ex f being set st
( f in Funcs ( the carrier of T,REAL) & S6[A,f] )

then A20: A in Union Bn by PROB_1:12;
Union Bn c= the topology of T by A5, TOPS_2:64;
then reconsider A = A as open Subset of T by A20, PRE_TOPC:def 2;
A ` misses A by XBOOLE_1:79;
then A21: A ` misses Cl (Vm . A) by A13, XBOOLE_1:63;
T is normal by A1, A4, NAGATA_1:20;
then consider f being Function of T,R^1 such that
A22: ( f is continuous & ( for p being Point of T holds
( 0 <= f . p & f . p <= 1 & ( p in A ` implies f . p = 0 ) & ( p in Cl (Vm . A) implies f . p = 1 ) ) ) ) by A21, URYSOHN3:20;
reconsider f9 = f as RealMap of T by TOPMETR:17;
A23: ex F being RealMap of T ex S being Subset of T st
( S = A & F = f9 & F is continuous & ( for p being Point of T holds
( 0 <= F . p & F . p <= 1 & ( p in S ` implies F . p = 0 ) & ( p in Cl (Vm . S) implies F . p = 1 ) ) ) )
proof
take f9 ; :: thesis: ex S being Subset of T st
( S = A & f9 = f9 & f9 is continuous & ( for p being Point of T holds
( 0 <= f9 . p & f9 . p <= 1 & ( p in S ` implies f9 . p = 0 ) & ( p in Cl (Vm . S) implies f9 . p = 1 ) ) ) )

take A ; :: thesis: ( A = A & f9 = f9 & f9 is continuous & ( for p being Point of T holds
( 0 <= f9 . p & f9 . p <= 1 & ( p in A ` implies f9 . p = 0 ) & ( p in Cl (Vm . A) implies f9 . p = 1 ) ) ) )

thus ( A = A & f9 = f9 & f9 is continuous & ( for p being Point of T holds
( 0 <= f9 . p & f9 . p <= 1 & ( p in A ` implies f9 . p = 0 ) & ( p in Cl (Vm . A) implies f9 . p = 1 ) ) ) ) by A22, TOPREAL6:74; :: thesis: verum
end;
f9 in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
hence ex f being set st
( f in Funcs ( the carrier of T,REAL) & S6[A,f] ) by A23; :: thesis: verum
end;
consider Fn being Function of (Bn . n),(Funcs ( the carrier of T,REAL)) such that
A24: for A being set st A in Bn . n holds
S6[A,Fn . A] from FUNCT_2:sch 1(A19);
Bn . n is locally_finite by A6, NAGATA_1:def 3;
then A25: for p being Element of the carrier of T ex A being Element of bool the carrier of T st S5[p,A] by PCOMPS_1:def 1;
consider Sx being Function of the carrier of T,(bool the carrier of T) such that
A26: for p being Element of the carrier of T holds S5[p,Sx . p] from FUNCT_2:sch 3(A25);
defpred S7[ set , set ] means for x, y being Element of T st $1 = [x,y] holds
$2 = [:(Sx . x),(Sx . y):];
A27: for pq9 being set st pq9 in the carrier of [:T,T:] holds
ex SS being set st
( SS in bool the carrier of [:T,T:] & S7[pq9,SS] )
proof
let pq9 be set ; :: thesis: ( pq9 in the carrier of [:T,T:] implies ex SS being set st
( SS in bool the carrier of [:T,T:] & S7[pq9,SS] ) )

assume pq9 in the carrier of [:T,T:] ; :: thesis: ex SS being set st
( SS in bool the carrier of [:T,T:] & S7[pq9,SS] )

then pq9 in [: the carrier of T, the carrier of T:] by BORSUK_1:def 2;
then consider p, q being set such that
A28: ( p in the carrier of T & q in the carrier of T ) and
A29: pq9 = [p,q] by ZFMISC_1:def 2;
reconsider p = p, q = q as Point of T by A28;
now
let p1, q1 be Point of T; :: thesis: ( pq9 = [p1,q1] implies [:(Sx . p),(Sx . q):] = [:(Sx . p1),(Sx . q1):] )
assume A30: pq9 = [p1,q1] ; :: thesis: [:(Sx . p),(Sx . q):] = [:(Sx . p1),(Sx . q1):]
then p1 = p by A29, ZFMISC_1:27;
hence [:(Sx . p),(Sx . q):] = [:(Sx . p1),(Sx . q1):] by A29, A30, ZFMISC_1:27; :: thesis: verum
end;
hence ex SS being set st
( SS in bool the carrier of [:T,T:] & S7[pq9,SS] ) ; :: thesis: verum
end;
consider SS being Function of the carrier of [:T,T:],(bool the carrier of [:T,T:]) such that
A31: for pq being set st pq in the carrier of [:T,T:] holds
S7[pq,SS . pq] from FUNCT_2:sch 1(A27);
A32: for pq9 being Point of [:T,T:] holds
( pq9 in SS . pq9 & SS . pq9 is open )
proof
let pq9 be Point of [:T,T:]; :: thesis: ( pq9 in SS . pq9 & SS . pq9 is open )
pq9 in the carrier of [:T,T:] ;
then pq9 in [: the carrier of T, the carrier of T:] by BORSUK_1:def 2;
then consider p, q being set such that
A33: ( p in the carrier of T & q in the carrier of T ) and
A34: pq9 = [p,q] by ZFMISC_1:def 2;
reconsider p = p, q = q as Point of T by A33;
A35: ( p in Sx . p & q in Sx . q ) by A26;
A36: ( Sx . p is open & Sx . q is open ) by A26;
SS . pq9 = [:(Sx . p),(Sx . q):] by A31, A34;
hence ( pq9 in SS . pq9 & SS . pq9 is open ) by A34, A35, A36, BORSUK_1:6, ZFMISC_1:def 2; :: thesis: verum
end;
A37: for f, g being Element of Funcs ( the carrier of [:T,T:],REAL) ex fg being Element of Funcs ( the carrier of [:T,T:],REAL) st S3[f,g,fg]
proof
let f, g be Element of Funcs ( the carrier of [:T,T:],REAL); :: thesis: ex fg being Element of Funcs ( the carrier of [:T,T:],REAL) st S3[f,g,fg]
set f9 = f;
set g9 = g;
f + g in Funcs ( the carrier of [:T,T:],REAL) by FUNCT_2:8;
hence ex fg being Element of Funcs ( the carrier of [:T,T:],REAL) st S3[f,g,fg] ; :: thesis: verum
end;
consider ADD being BinOp of (Funcs ( the carrier of [:T,T:],REAL)) such that
A38: for f, g being Element of Funcs ( the carrier of [:T,T:],REAL) holds S3[f,g,ADD . (f,g)] from BINOP_1:sch 3(A37);
A39: for f being Element of Funcs ( the carrier of T,REAL) ex fxy being Element of Funcs ( the carrier of [:T,T:],REAL) st S4[f,fxy]
proof
let f be Element of Funcs ( the carrier of T,REAL); :: thesis: ex fxy being Element of Funcs ( the carrier of [:T,T:],REAL) st S4[f,fxy]
defpred S8[ Element of T, Element of T, set ] means $3 = abs ((f . $1) - (f . $2));
A40: for x, y being Element of the carrier of T ex r being Element of REAL st S8[x,y,r] ;
consider Fd being Function of [: the carrier of T, the carrier of T:],REAL such that
A41: for x, y being Element of the carrier of T holds S8[x,y,Fd . (x,y)] from BINOP_1:sch 3(A40);
[: the carrier of T, the carrier of T:] = the carrier of [:T,T:] by BORSUK_1:def 2;
then Fd in Funcs ( the carrier of [:T,T:],REAL) by FUNCT_2:8;
hence ex fxy being Element of Funcs ( the carrier of [:T,T:],REAL) st S4[f,fxy] by A41; :: thesis: verum
end;
consider Fdist being Function of (Funcs ( the carrier of T,REAL)),(Funcs ( the carrier of [:T,T:],REAL)) such that
A42: for fd being Element of Funcs ( the carrier of T,REAL) holds S4[fd,Fdist . fd] from FUNCT_2:sch 3(A39);
deffunc H3( Element of T) -> set = { (Fn . A) where A is Subset of T : ( A in Bn . n & A in H2(Sx . $1) ) } ;
deffunc H4( set ) -> set = { (Fdist . fd) where fd is RealMap of T : fd in $1 } ;
defpred S8[ set , Function] means ( $2 is one-to-one & ex p, q being Point of T st
( [p,q] = $1 & rng $2 = H4(H3(p) \/ H3(q)) ) );
A43: for p being Point of T holds H3(p) is finite
proof
deffunc H5( Subset of T) -> set = Fn . $1;
let p be Point of T; :: thesis: H3(p) is finite
set SFxx = { H5(A) where A is Subset of T : A in H2(Sx . p) } ;
A44: H3(p) c= { H5(A) where A is Subset of T : A in H2(Sx . p) }
proof
let FA be set ; :: according to TARSKI:def 3 :: thesis: ( not FA in H3(p) or FA in { H5(A) where A is Subset of T : A in H2(Sx . p) } )
assume FA in H3(p) ; :: thesis: FA in { H5(A) where A is Subset of T : A in H2(Sx . p) }
then ex A being Subset of T st
( FA = Fn . A & A in Bn . n & A in H2(Sx . p) ) ;
hence FA in { H5(A) where A is Subset of T : A in H2(Sx . p) } ; :: thesis: verum
end;
A45: H2(Sx . p) is finite by A26;
{ H5(A) where A is Subset of T : A in H2(Sx . p) } is finite from FRAENKEL:sch 21(A45);
hence H3(p) is finite by A44; :: thesis: verum
end;
A46: for p, q being Point of T holds
( H4(H3(p) \/ H3(q)) is finite & H4(H3(p) \/ H3(q)) c= Funcs ( the carrier of [:T,T:],REAL) )
proof
deffunc H5( RealMap of T) -> set = Fdist . $1;
let p, q be Point of T; :: thesis: ( H4(H3(p) \/ H3(q)) is finite & H4(H3(p) \/ H3(q)) c= Funcs ( the carrier of [:T,T:],REAL) )
A47: H4(H3(p) \/ H3(q)) c= Funcs ( the carrier of [:T,T:],REAL)
proof
let FDm be set ; :: according to TARSKI:def 3 :: thesis: ( not FDm in H4(H3(p) \/ H3(q)) or FDm in Funcs ( the carrier of [:T,T:],REAL) )
assume FDm in H4(H3(p) \/ H3(q)) ; :: thesis: FDm in Funcs ( the carrier of [:T,T:],REAL)
then consider fd being RealMap of T such that
A48: FDm = Fdist . fd and
fd in H3(p) \/ H3(q) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
hence FDm in Funcs ( the carrier of [:T,T:],REAL) by A48, FUNCT_2:5; :: thesis: verum
end;
set RNG9 = { H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) } ;
A49: H4(H3(p) \/ H3(q)) c= { H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) }
proof
let Fdistfd be set ; :: according to TARSKI:def 3 :: thesis: ( not Fdistfd in H4(H3(p) \/ H3(q)) or Fdistfd in { H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) } )
assume Fdistfd in H4(H3(p) \/ H3(q)) ; :: thesis: Fdistfd in { H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) }
then consider fd being RealMap of T such that
A50: ( Fdistfd = Fdist . fd & fd in H3(p) \/ H3(q) ) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
hence Fdistfd in { H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) } by A50; :: thesis: verum
end;
( H3(p) is finite & H3(q) is finite ) by A43;
then A51: H3(p) \/ H3(q) is finite ;
{ H5(fd) where fd is Element of Funcs ( the carrier of T,REAL) : fd in H3(p) \/ H3(q) } is finite from FRAENKEL:sch 21(A51);
hence ( H4(H3(p) \/ H3(q)) is finite & H4(H3(p) \/ H3(q)) c= Funcs ( the carrier of [:T,T:],REAL) ) by A47, A49; :: thesis: verum
end;
A52: for pq being Element of the carrier of [:T,T:] ex G being Element of (Funcs ( the carrier of [:T,T:],REAL)) * st S8[pq,G]
proof
let pq be Element of the carrier of [:T,T:]; :: thesis: ex G being Element of (Funcs ( the carrier of [:T,T:],REAL)) * st S8[pq,G]
pq in the carrier of [:T,T:] ;
then pq in [: the carrier of T, the carrier of T:] by BORSUK_1:def 2;
then consider p, q being set such that
A53: ( p in the carrier of T & q in the carrier of T ) and
A54: pq = [p,q] by ZFMISC_1:def 2;
reconsider p = p, q = q as Point of T by A53;
consider SF being FinSequence such that
A55: rng SF = H4(H3(p) \/ H3(q)) and
A56: SF is one-to-one by A46, FINSEQ_4:58;
rng SF c= Funcs ( the carrier of [:T,T:],REAL) by A46, A55;
then reconsider SF = SF as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 4;
SF in (Funcs ( the carrier of [:T,T:],REAL)) * by FINSEQ_1:def 11;
hence ex G being Element of (Funcs ( the carrier of [:T,T:],REAL)) * st S8[pq,G] by A54, A55, A56; :: thesis: verum
end;
consider SFdist being Function of the carrier of [:T,T:],((Funcs ( the carrier of [:T,T:],REAL)) *) such that
A57: for pq being Element of the carrier of [:T,T:] holds S8[pq,SFdist . pq] from FUNCT_2:sch 3(A52);
defpred S9[ set , set ] means for FS being FinSequence of Funcs ( the carrier of [:T,T:],REAL) st FS = SFdist . $1 holds
$2 = ADD "**" FS;
A58: for pq being set st pq in the carrier of [:T,T:] holds
ex S being set st
( S in Funcs ( the carrier of [:T,T:],REAL) & S9[pq,S] )
proof
let pq be set ; :: thesis: ( pq in the carrier of [:T,T:] implies ex S being set st
( S in Funcs ( the carrier of [:T,T:],REAL) & S9[pq,S] ) )

assume pq in the carrier of [:T,T:] ; :: thesis: ex S being set st
( S in Funcs ( the carrier of [:T,T:],REAL) & S9[pq,S] )

then SFdist . pq in (Funcs ( the carrier of [:T,T:],REAL)) * by FUNCT_2:5;
then reconsider SF = SFdist . pq as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
for FS being FinSequence of Funcs ( the carrier of [:T,T:],REAL) st FS = SFdist . pq holds
ADD "**" FS = ADD "**" SF ;
hence ex S being set st
( S in Funcs ( the carrier of [:T,T:],REAL) & S9[pq,S] ) ; :: thesis: verum
end;
consider SumFdist being Function of the carrier of [:T,T:],(Funcs ( the carrier of [:T,T:],REAL)) such that
A59: for xy being set st xy in the carrier of [:T,T:] holds
S9[xy,SumFdist . xy] from FUNCT_2:sch 1(A58);
reconsider SumFdist9 = SumFdist as Function of the carrier of [:T,T:],(Funcs ( the carrier of [:T,T:], the carrier of R^1)) by TOPMETR:17;
reconsider SumFTS9 = SumFdist9 Toler as RealMap of [:T,T:] by TOPMETR:17;
the carrier of [:T,T:] = [: the carrier of T, the carrier of T:] by BORSUK_1:def 2;
then reconsider SumFTS = SumFdist9 Toler as Function of [: the carrier of T, the carrier of T:],REAL by TOPMETR:17;
A60: for f1, f2 being RealMap of [:T,T:] holds ADD . (f1,f2) = f1 + f2
proof
let f1, f2 be RealMap of [:T,T:]; :: thesis: ADD . (f1,f2) = f1 + f2
reconsider f19 = f1, f29 = f2 as Element of Funcs ( the carrier of [:T,T:],REAL) by FUNCT_2:8;
ADD . (f19,f29) = f19 + f29 by A38;
hence ADD . (f1,f2) = f1 + f2 ; :: thesis: verum
end;
A61: for p, q being Point of T st ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) holds
SumFTS9 . [p,q] >= 1
proof
let p, q be Point of T; :: thesis: ( ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) implies SumFTS9 . [p,q] >= 1 )

assume ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) ; :: thesis: SumFTS9 . [p,q] >= 1
then consider A, B being Subset of T such that
A is open and
B is open and
A62: A in Bn . m and
A63: B in Bn . n and
A64: p in A and
A65: Cl A c= B and
A66: not q in B ;
A67: S6[B,Fn . B] by A24, A63;
A in { Q where Q is Subset of T : ( Q in Bn . m & Cl Q c= B ) } by A62, A65;
then A c= H1(B) by ZFMISC_1:74;
then A68: A c= Vm . B by A11;
Vm . B c= Cl (Vm . B) by PRE_TOPC:18;
then A69: p in Cl (Vm . B) by A64, A68, TARSKI:def 3;
( Cl (Vm . B) c= B & p in Sx . p ) by A13, A26;
then Sx . p meets B by A69, XBOOLE_0:3;
then A70: B in H2(Sx . p) by A63;
reconsider pq = [p,q] as Point of [:T,T:] by BORSUK_1:def 2;
reconsider SF = SFdist . pq as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
consider x, y being Point of T such that
A71: [x,y] = pq and
A72: rng SF = H4(H3(x) \/ H3(y)) by A57;
reconsider ASF = ADD "**" SF as RealMap of [:T,T:] by FUNCT_2:66;
assume A73: SumFTS9 . [p,q] < 1 ; :: thesis: contradiction
reconsider FnB = Fn . B as RealMap of T by A63, FUNCT_2:5, FUNCT_2:66;
A74: FnB in Funcs ( the carrier of T,REAL) by A63, FUNCT_2:5;
q in B ` by A66, XBOOLE_0:def 5;
then A75: FnB . q = 0 by A67;
x = p by A71, ZFMISC_1:27;
then FnB in H3(x) by A63, A70;
then FnB in H3(x) \/ H3(y) by XBOOLE_0:def 3;
then A76: Fdist . FnB in rng SF by A72;
then reconsider FdistFnB = Fdist . FnB as RealMap of [:T,T:] by FUNCT_2:66;
SF <> {} by A76, RELAT_1:38;
then len SF >= 1 by NAT_1:14;
then consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A77: F . 1 = SF . 1 and
A78: for n being Element of NAT st 0 <> n & n < len SF holds
F . (n + 1) = ADD . ((F . n),(SF . (n + 1))) and
A79: ADD "**" SF = F . (len SF) by FINSOP_1:def 1;
A80: ( SumFTS . pq = (SumFdist . pq) . pq & SumFdist . pq = ASF ) by A59, NAGATA_1:def 8;
defpred S10[ Element of NAT ] means for k being Element of NAT st k <> 0 & k <= $1 & $1 <= len SF holds
for fk, Fn being RealMap of [:T,T:] st fk = SF . k & Fn = F . $1 holds
fk . pq <= Fn . pq;
A81: for k being Element of NAT st k <> 0 & k <= len SF holds
for f being RealMap of [:T,T:] st f = SF . k holds
f . pq >= 0
proof
let k be Element of NAT ; :: thesis: ( k <> 0 & k <= len SF implies for f being RealMap of [:T,T:] st f = SF . k holds
f . pq >= 0 )

assume that
A82: k <> 0 and
A83: k <= len SF ; :: thesis: for f being RealMap of [:T,T:] st f = SF . k holds
f . pq >= 0

k >= 1 by A82, NAT_1:14;
then k in dom SF by A83, FINSEQ_3:25;
then SF . k in H4(H3(x) \/ H3(y)) by A72, FUNCT_1:def 3;
then consider fd being RealMap of T such that
A84: Fdist . fd = SF . k and
fd in H3(x) \/ H3(y) ;
let f be RealMap of [:T,T:]; :: thesis: ( f = SF . k implies f . pq >= 0 )
assume A85: f = SF . k ; :: thesis: f . pq >= 0
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then f . (p,q) = abs ((fd . p) - (fd . q)) by A42, A85, A84;
hence f . pq >= 0 by COMPLEX1:46; :: thesis: verum
end;
A86: for i being Element of NAT st S10[i] holds
S10[i + 1]
proof
let i be Element of NAT ; :: thesis: ( S10[i] implies S10[i + 1] )
assume A87: S10[i] ; :: thesis: S10[i + 1]
let k be Element of NAT ; :: thesis: ( k <> 0 & k <= i + 1 & i + 1 <= len SF implies for fk, Fn being RealMap of [:T,T:] st fk = SF . k & Fn = F . (i + 1) holds
fk . pq <= Fn . pq )

assume that
A88: k <> 0 and
A89: k <= i + 1 and
A90: i + 1 <= len SF ; :: thesis: for fk, Fn being RealMap of [:T,T:] st fk = SF . k & Fn = F . (i + 1) holds
fk . pq <= Fn . pq

now
1 <= i + 1 by NAT_1:14;
then i + 1 in dom SF by A90, FINSEQ_3:25;
then SF . (i + 1) in rng SF by FUNCT_1:def 3;
then reconsider SFi1 = SF . (i + 1) as RealMap of [:T,T:] by FUNCT_2:66;
reconsider Fi = F . i as RealMap of [:T,T:] by FUNCT_2:66;
let fk, Fn be RealMap of [:T,T:]; :: thesis: ( fk = SF . k & Fn = F . (i + 1) implies b1 . pq <= b2 . pq )
assume that
A91: fk = SF . k and
A92: Fn = F . (i + 1) ; :: thesis: b1 . pq <= b2 . pq
per cases ( k < i + 1 or k = i + 1 ) by A89, XXREAL_0:1;
suppose A93: k < i + 1 ; :: thesis: b1 . pq <= b2 . pq
A94: i < len SF by A90, NAT_1:13;
i <> 0 by A88, A93, NAT_1:13;
then F . (i + 1) = ADD . ((F . i),(SF . (i + 1))) by A78, A94;
then A95: Fn = Fi + SFi1 by A60, A92;
SFi1 . pq >= 0 by A81, A90;
then (Fi . pq) + 0 <= (Fi . pq) + (SFi1 . pq) by XREAL_1:7;
then A96: Fn . pq >= Fi . pq by A95, NAGATA_1:def 7;
A97: i <= len SF by A90, NAT_1:13;
k <= i by A93, NAT_1:13;
then fk . pq <= Fi . pq by A87, A88, A91, A97;
hence fk . pq <= Fn . pq by A96, XXREAL_0:2; :: thesis: verum
end;
suppose A98: k = i + 1 ; :: thesis: b1 . pq <= b2 . pq
per cases ( i = 0 or i <> 0 ) ;
suppose i = 0 ; :: thesis: b1 . pq <= b2 . pq
hence fk . pq <= Fn . pq by A77, A91, A92, A98; :: thesis: verum
end;
suppose A99: i <> 0 ; :: thesis: b1 . pq <= b2 . pq
i + 0 < i + 1 by XREAL_1:8;
then A100: i < len SF by A90, XXREAL_0:2;
1 <= i by A99, NAT_1:14;
then i in dom SF by A100, FINSEQ_3:25;
then SF . i in rng SF by FUNCT_1:def 3;
then reconsider SFi = SF . i as RealMap of [:T,T:] by FUNCT_2:66;
0 <= SFi . pq by A81, A99, A100;
then 0 <= Fi . pq by A87, A99, A100;
then A101: (Fi . pq) + (fk . pq) >= 0 + (fk . pq) by XREAL_1:7;
F . (i + 1) = ADD . ((F . i),(SF . (i + 1))) by A78, A99, A100;
then Fn = Fi + fk by A60, A91, A92, A98;
hence fk . pq <= Fn . pq by A101, NAGATA_1:def 7; :: thesis: verum
end;
end;
end;
end;
end;
hence for fk, Fn being RealMap of [:T,T:] st fk = SF . k & Fn = F . (i + 1) holds
fk . pq <= Fn . pq ; :: thesis: verum
end;
A102: S10[ 0 ] ;
A103: for i being Element of NAT holds S10[i] from NAT_1:sch 1(A102, A86);
consider k being set such that
A104: k in dom SF and
A105: SF . k = Fdist . FnB by A76, FUNCT_1:def 3;
A106: k in Seg (len SF) by A104, FINSEQ_1:def 3;
FnB . p = 1 by A69, A67;
then A107: FdistFnB . (p,q) = abs (1 - 0) by A42, A74, A75;
reconsider k = k as Element of NAT by A104;
A108: abs 1 = 1 by ABSVALUE:def 1;
( k <> 0 & k <= len SF ) by A106, FINSEQ_1:1;
hence contradiction by A73, A80, A79, A103, A107, A108, A105; :: thesis: verum
end;
A109: now
let p, q be Point of T; :: thesis: ( ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) implies 1 = (min (1,SumFTS9)) . [p,q] )

assume ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) ; :: thesis: 1 = (min (1,SumFTS9)) . [p,q]
then SumFTS9 . [p,q] >= 1 by A61;
then A110: 1 = min (1,(SumFTS9 . [p,q])) by XXREAL_0:def 9;
[: the carrier of T, the carrier of T:] = the carrier of [:T,T:] by BORSUK_1:def 2;
hence 1 = (min (1,SumFTS9)) . [p,q] by A110, NAGATA_1:def 9; :: thesis: verum
end;
A111: for pq being Element of the carrier of [:T,T:]
for map9 being Element of Funcs ( the carrier of [:T,T:],REAL) st map9 is_a_unity_wrt ADD holds
map9 . pq = 0
proof
let pq be Element of the carrier of [:T,T:]; :: thesis: for map9 being Element of Funcs ( the carrier of [:T,T:],REAL) st map9 is_a_unity_wrt ADD holds
map9 . pq = 0

let map9 be Element of Funcs ( the carrier of [:T,T:],REAL); :: thesis: ( map9 is_a_unity_wrt ADD implies map9 . pq = 0 )
assume map9 is_a_unity_wrt ADD ; :: thesis: map9 . pq = 0
then ADD . (map9,map9) = map9 by BINOP_1:3;
then (map9 + map9) . pq = map9 . pq by A38;
then (map9 . pq) + (map9 . pq) = map9 . pq by NAGATA_1:def 7;
hence map9 . pq = 0 ; :: thesis: verum
end;
A112: for pq1, pq2 being Point of [:T,T:] holds
( ( pq1 in SS . pq2 implies (SumFdist . pq1) . pq1 = (SumFdist . pq2) . pq1 ) & ( for SumFdist1, SumFdist2 being RealMap of [:T,T:] st SumFdist1 = SumFdist . pq1 & SumFdist2 = SumFdist . pq2 holds
SumFdist1 . pq1 >= SumFdist2 . pq1 ) )
proof
deffunc H5( Element of T, Element of T) -> set = { (Fn . A) where A is Subset of T : ( A in Bn . n & ( for FnA being RealMap of T holds
( not Fn . A = FnA or FnA . $1 > 0 or FnA . $2 > 0 ) ) )
}
;
let pq1, pq2 be Point of [:T,T:]; :: thesis: ( ( pq1 in SS . pq2 implies (SumFdist . pq1) . pq1 = (SumFdist . pq2) . pq1 ) & ( for SumFdist1, SumFdist2 being RealMap of [:T,T:] st SumFdist1 = SumFdist . pq1 & SumFdist2 = SumFdist . pq2 holds
SumFdist1 . pq1 >= SumFdist2 . pq1 ) )

reconsider S1 = SFdist . pq1, S2 = SFdist . pq2 as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
consider p1, q1 being Point of T such that
A113: [p1,q1] = pq1 and
A114: rng S1 = H4(H3(p1) \/ H3(q1)) by A57;
A115: for p, q, p1, q1 being Point of T st [p,q] in SS . [p1,q1] holds
H5(p,q) c= H3(p1) \/ H3(q1)
proof
let p, q, p1, q1 be Point of T; :: thesis: ( [p,q] in SS . [p1,q1] implies H5(p,q) c= H3(p1) \/ H3(q1) )
assume A116: [p,q] in SS . [p1,q1] ; :: thesis: H5(p,q) c= H3(p1) \/ H3(q1)
reconsider pq1 = [p1,q1] as Element of the carrier of [:T,T:] by BORSUK_1:def 2;
[:(Sx . p1),(Sx . q1):] = SS . pq1 by A31;
then A117: ( p in Sx . p1 & q in Sx . q1 ) by A116, ZFMISC_1:87;
let no0 be set ; :: according to TARSKI:def 3 :: thesis: ( not no0 in H5(p,q) or no0 in H3(p1) \/ H3(q1) )
assume no0 in H5(p,q) ; :: thesis: no0 in H3(p1) \/ H3(q1)
then consider A being Subset of T such that
A118: no0 = Fn . A and
A119: A in Bn . n and
A120: for FnA being RealMap of T holds
( not Fn . A = FnA or FnA . p > 0 or FnA . q > 0 ) ;
reconsider FnA = Fn . A as RealMap of T by A119, FUNCT_2:5, FUNCT_2:66;
A121: ( FnA . p > 0 or FnA . q > 0 ) by A120;
S6[A,Fn . A] by A24, A119;
then ( not p in the carrier of T \ A or not q in the carrier of T \ A ) by A121;
then ( p in A or q in A ) by XBOOLE_0:def 5;
then ( A meets Sx . p1 or A meets Sx . q1 ) by A117, XBOOLE_0:3;
then ( A in H2(Sx . p1) or A in H2(Sx . q1) ) by A119;
then ( FnA in H3(p1) or FnA in H3(q1) ) by A119;
hence no0 in H3(p1) \/ H3(q1) by A118, XBOOLE_0:def 3; :: thesis: verum
end;
A122: H4(H5(p1,q1)) c= H4(H3(p1) \/ H3(q1))
proof
( p1 in Sx . p1 & q1 in Sx . q1 ) by A26;
then [p1,q1] in [:(Sx . p1),(Sx . q1):] by ZFMISC_1:87;
then [p1,q1] in SS . [p1,q1] by A31;
then A123: H5(p1,q1) c= H3(p1) \/ H3(q1) by A115;
let FD be set ; :: according to TARSKI:def 3 :: thesis: ( not FD in H4(H5(p1,q1)) or FD in H4(H3(p1) \/ H3(q1)) )
assume FD in H4(H5(p1,q1)) ; :: thesis: FD in H4(H3(p1) \/ H3(q1))
then ex fd being RealMap of T st
( FD = Fdist . fd & fd in H5(p1,q1) ) ;
hence FD in H4(H3(p1) \/ H3(q1)) by A123; :: thesis: verum
end;
A124: for f being FinSequence of Funcs ( the carrier of [:T,T:],REAL)
for p, q, p1, q1 being Point of T st rng f = H4(H3(p1) \/ H3(q1)) \ H4(H5(p,q)) holds
(ADD "**" f) . [p,q] = 0
proof
let f be FinSequence of Funcs ( the carrier of [:T,T:],REAL); :: thesis: for p, q, p1, q1 being Point of T st rng f = H4(H3(p1) \/ H3(q1)) \ H4(H5(p,q)) holds
(ADD "**" f) . [p,q] = 0

let p, q, p1, q1 be Point of T; :: thesis: ( rng f = H4(H3(p1) \/ H3(q1)) \ H4(H5(p,q)) implies (ADD "**" f) . [p,q] = 0 )
assume A125: rng f = H4(H3(p1) \/ H3(q1)) \ H4(H5(p,q)) ; :: thesis: (ADD "**" f) . [p,q] = 0
reconsider pq = [p,q] as Element of the carrier of [:T,T:] by BORSUK_1:def 2;
now
per cases ( len f = 0 or len f <> 0 ) ;
suppose A129: len f <> 0 ; :: thesis: (ADD "**" f) . pq = 0
then len f >= 1 by NAT_1:14;
then consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A130: F . 1 = f . 1 and
A131: for n being Element of NAT st 0 <> n & n < len f holds
F . (n + 1) = ADD . ((F . n),(f . (n + 1))) and
A132: ADD "**" f = F . (len f) by FINSOP_1:def 1;
defpred S10[ Element of NAT ] means ( $1 <> 0 & $1 <= len f implies (F . $1) . pq = 0 );
A133: for k being Element of NAT st S10[k] holds
S10[k + 1]
proof
let k be Element of NAT ; :: thesis: ( S10[k] implies S10[k + 1] )
assume A134: S10[k] ; :: thesis: S10[k + 1]
assume that
k + 1 <> 0 and
A135: k + 1 <= len f ; :: thesis: (F . (k + 1)) . pq = 0
A136: k < len f by A135, NAT_1:13;
k + 1 >= 1 by NAT_1:14;
then k + 1 in dom f by A135, FINSEQ_3:25;
then A137: f . (k + 1) in H4(H3(p1) \/ H3(q1)) \ H4(H5(p,q)) by A125, FUNCT_1:def 3;
then f . (k + 1) in H4(H3(p1) \/ H3(q1)) ;
then consider fd being RealMap of T such that
A138: Fdist . fd = f . (k + 1) and
A139: fd in H3(p1) \/ H3(q1) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then reconsider Fdistfd = Fdist . fd, Fk1 = F . (k + 1), Fk = F . k, fk1 = f . (k + 1) as RealMap of [:T,T:] by A138, FUNCT_2:5, FUNCT_2:66;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then A140: Fdistfd . (p,q) = abs ((fd . p) - (fd . q)) by A42;
A141: not f . (k + 1) in H4(H5(p,q)) by A137, XBOOLE_0:def 5;
A142: ( fd . p = 0 & fd . q = 0 )
proof
assume A143: ( fd . p <> 0 or fd . q <> 0 ) ; :: thesis: contradiction
per cases ( fd in H3(p1) or fd in H3(q1) ) by A139, XBOOLE_0:def 3;
suppose fd in H3(p1) ; :: thesis: contradiction
then consider A being Subset of T such that
A144: fd = Fn . A and
A145: A in Bn . n and
A in H2(Sx . p1) ;
A146: S6[A,Fn . A] by A24, A145;
not fd in H5(p,q) by A141, A138;
then ex FnA being RealMap of T st
( Fn . A = FnA & not FnA . p > 0 & not FnA . q > 0 ) by A144, A145;
hence contradiction by A143, A144, A146; :: thesis: verum
end;
suppose fd in H3(q1) ; :: thesis: contradiction
then consider A being Subset of T such that
A147: fd = Fn . A and
A148: A in Bn . n and
A in H2(Sx . q1) ;
A149: S6[A,Fn . A] by A24, A148;
not fd in H5(p,q) by A141, A138;
then ex FnA being RealMap of T st
( Fn . A = FnA & not FnA . p > 0 & not FnA . q > 0 ) by A147, A148;
hence contradiction by A143, A147, A149; :: thesis: verum
end;
end;
end;
per cases ( k = 0 or k > 0 ) ;
suppose k = 0 ; :: thesis: (F . (k + 1)) . pq = 0
hence (F . (k + 1)) . pq = 0 by A130, A138, A142, A140, ABSVALUE:2; :: thesis: verum
end;
suppose A150: k > 0 ; :: thesis: (F . (k + 1)) . pq = 0
then Fk1 = ADD . (Fk,fk1) by A131, A136;
then Fk1 = Fk + fk1 by A60;
then Fk1 . pq = 0 + (fk1 . pq) by A134, A135, A150, NAGATA_1:def 7, NAT_1:13;
hence (F . (k + 1)) . pq = 0 by A138, A142, A140, ABSVALUE:2; :: thesis: verum
end;
end;
end;
A151: S10[ 0 ] ;
for n being Element of NAT holds S10[n] from NAT_1:sch 1(A151, A133);
hence (ADD "**" f) . pq = 0 by A129, A132; :: thesis: verum
end;
end;
end;
hence (ADD "**" f) . [p,q] = 0 ; :: thesis: verum
end;
A152: H4(H3(p1) \/ H3(q1)) is finite by A46;
then consider No being FinSequence such that
A153: rng No = H4(H5(p1,q1)) and
A154: No is one-to-one by A122, FINSEQ_4:58;
H4(H3(p1) \/ H3(q1)) c= Funcs ( the carrier of [:T,T:],REAL) by A46;
then A155: H4(H5(p1,q1)) c= Funcs ( the carrier of [:T,T:],REAL) by A122, XBOOLE_1:1;
then reconsider No = No as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by A153, FINSEQ_1:def 4;
consider p2, q2 being Point of T such that
A156: [p2,q2] = pq2 and
A157: rng S2 = H4(H3(p2) \/ H3(q2)) by A57;
reconsider S1 = SFdist . pq1, S2 = SFdist . pq2 as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
set RNiS2 = H4(H5(p1,q1)) /\ H4(H3(p2) \/ H3(q2));
A158: S2 is one-to-one by A57;
A159: ( ADD is having_a_unity & ADD is commutative & ADD is associative ) by A60, NAGATA_1:23;
S1 is one-to-one by A57;
then consider S1No being FinSequence of Funcs ( the carrier of [:T,T:],REAL) such that
S1No is one-to-one and
A160: rng S1No = (rng S1) \ (rng No) and
A161: ADD "**" S1 = ADD . ((ADD "**" No),(ADD "**" S1No)) by A114, A122, A153, A154, A159, Th18;
consider NoiS2 being FinSequence such that
A162: rng NoiS2 = H4(H5(p1,q1)) /\ H4(H3(p2) \/ H3(q2)) and
A163: NoiS2 is one-to-one by A122, A152, FINSEQ_4:58;
H4(H5(p1,q1)) /\ H4(H3(p2) \/ H3(q2)) c= H4(H5(p1,q1)) by XBOOLE_1:17;
then H4(H5(p1,q1)) /\ H4(H3(p2) \/ H3(q2)) c= Funcs ( the carrier of [:T,T:],REAL) by A155, XBOOLE_1:1;
then reconsider NoiS2 = NoiS2 as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by A162, FINSEQ_1:def 4;
rng NoiS2 c= rng No by A153, A162, XBOOLE_1:17;
then consider NoNoiS2 being FinSequence of Funcs ( the carrier of [:T,T:],REAL) such that
NoNoiS2 is one-to-one and
A164: rng NoNoiS2 = (rng No) \ (rng NoiS2) and
A165: ADD "**" No = ADD . ((ADD "**" NoiS2),(ADD "**" NoNoiS2)) by A154, A159, A163, Th18;
rng NoiS2 c= rng S2 by A157, A162, XBOOLE_1:17;
then consider S2No being FinSequence of Funcs ( the carrier of [:T,T:],REAL) such that
S2No is one-to-one and
A166: rng S2No = (rng S2) \ (rng NoiS2) and
A167: ADD "**" S2 = ADD . ((ADD "**" NoiS2),(ADD "**" S2No)) by A159, A163, A158, Th18;
reconsider ANoNoiS2 = ADD "**" NoNoiS2, ANo = ADD "**" No, AS1No = ADD "**" S1No, AS2No = ADD "**" S2No, ANoiS2 = ADD "**" NoiS2, AS1 = ADD "**" S1, AS2 = ADD "**" S2 as RealMap of [:T,T:] by FUNCT_2:66;
rng S2No = H4(H3(p2) \/ H3(q2)) \ H4(H5(p1,q1)) by A157, A162, A166, XBOOLE_1:47;
then A168: AS2No . pq1 = 0 by A124, A113;
ANo = ANoiS2 + ANoNoiS2 by A60, A165;
then A169: ANo . pq1 = (ANoiS2 . pq1) + (ANoNoiS2 . pq1) by NAGATA_1:def 7;
AS1 = ANo + AS1No by A60, A161;
then A170: AS1 . pq1 = (ANo . pq1) + (AS1No . pq1) by NAGATA_1:def 7;
AS2 = ANoiS2 + AS2No by A60, A167;
then A171: AS2 . pq1 = (ANoiS2 . pq1) + (AS2No . pq1) by NAGATA_1:def 7;
A172: AS1No . pq1 = 0 by A124, A113, A114, A153, A160;
thus ( pq1 in SS . pq2 implies (SumFdist . pq1) . pq1 = (SumFdist . pq2) . pq1 ) :: thesis: for SumFdist1, SumFdist2 being RealMap of [:T,T:] st SumFdist1 = SumFdist . pq1 & SumFdist2 = SumFdist . pq2 holds
SumFdist1 . pq1 >= SumFdist2 . pq1
proof
A173: ADD is having_a_unity by A60, NAGATA_1:23;
then A174: ex f being Element of Funcs ( the carrier of [:T,T:],REAL) st f is_a_unity_wrt ADD by SETWISEO:def 2;
assume A175: pq1 in SS . pq2 ; :: thesis: (SumFdist . pq1) . pq1 = (SumFdist . pq2) . pq1
now
let FD be set ; :: thesis: ( FD in H4(H5(p1,q1)) implies FD in H4(H3(p2) \/ H3(q2)) )
assume FD in H4(H5(p1,q1)) ; :: thesis: FD in H4(H3(p2) \/ H3(q2))
then A176: ex fd being RealMap of T st
( FD = Fdist . fd & fd in H5(p1,q1) ) ;
H5(p1,q1) c= H3(p2) \/ H3(q2) by A115, A113, A156, A175;
hence FD in H4(H3(p2) \/ H3(q2)) by A176; :: thesis: verum
end;
then H4(H5(p1,q1)) c= H4(H3(p2) \/ H3(q2)) by TARSKI:def 3;
then H4(H5(p1,q1)) /\ H4(H3(p2) \/ H3(q2)) = H4(H5(p1,q1)) by XBOOLE_1:28;
then rng NoNoiS2 = {} by A153, A162, A164, XBOOLE_1:37;
then NoNoiS2 = {} by RELAT_1:41;
then len NoNoiS2 = 0 ;
then ADD "**" NoNoiS2 = the_unity_wrt ADD by A173, FINSOP_1:def 1;
then ADD "**" NoNoiS2 is_a_unity_wrt ADD by A174, BINOP_1:def 8;
then A177: AS1 . pq1 = AS2 . pq1 by A111, A170, A169, A171, A172, A168;
SumFdist . pq1 = AS1 by A59;
hence (SumFdist . pq1) . pq1 = (SumFdist . pq2) . pq1 by A59, A177; :: thesis: verum
end;
A178: ANoNoiS2 . (p1,q1) >= 0
proof
set N = NoNoiS2;
per cases ( len NoNoiS2 = 0 or len NoNoiS2 <> 0 ) ;
suppose A182: len NoNoiS2 <> 0 ; :: thesis: ANoNoiS2 . (p1,q1) >= 0
then len NoNoiS2 >= 1 by NAT_1:14;
then consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A183: F . 1 = NoNoiS2 . 1 and
A184: for n being Element of NAT st 0 <> n & n < len NoNoiS2 holds
F . (n + 1) = ADD . ((F . n),(NoNoiS2 . (n + 1))) and
A185: ADD "**" NoNoiS2 = F . (len NoNoiS2) by FINSOP_1:def 1;
defpred S10[ Element of NAT ] means ( $1 <> 0 & $1 <= len NoNoiS2 implies for Fn being RealMap of [:T,T:] st Fn = F . $1 holds
Fn . (p1,q1) >= 0 );
A186: for k being Element of NAT st S10[k] holds
S10[k + 1]
proof
let k be Element of NAT ; :: thesis: ( S10[k] implies S10[k + 1] )
assume A187: S10[k] ; :: thesis: S10[k + 1]
assume that
k + 1 <> 0 and
A188: k + 1 <= len NoNoiS2 ; :: thesis: for Fn being RealMap of [:T,T:] st Fn = F . (k + 1) holds
Fn . (p1,q1) >= 0

A189: k < len NoNoiS2 by A188, NAT_1:13;
k + 1 >= 1 by NAT_1:14;
then k + 1 in dom NoNoiS2 by A188, FINSEQ_3:25;
then NoNoiS2 . (k + 1) in (rng No) \ (rng NoiS2) by A164, FUNCT_1:def 3;
then NoNoiS2 . (k + 1) in H4(H5(p1,q1)) by A153, XBOOLE_0:def 5;
then consider fd being RealMap of T such that
A190: Fdist . fd = NoNoiS2 . (k + 1) and
fd in H5(p1,q1) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then reconsider Fdistfd = Fdist . fd, Fk1 = F . (k + 1), Fk = F . k, Nk1 = NoNoiS2 . (k + 1) as RealMap of [:T,T:] by A190, FUNCT_2:5, FUNCT_2:66;
A191: abs ((fd . p1) - (fd . q1)) >= 0 by COMPLEX1:46;
A192: fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then A193: Fdistfd . (p1,q1) = abs ((fd . p1) - (fd . q1)) by A42;
A194: now
per cases ( k = 0 or k > 0 ) ;
suppose k = 0 ; :: thesis: Fk1 . (p1,q1) >= 0
hence Fk1 . (p1,q1) >= 0 by A42, A183, A190, A192, A191; :: thesis: verum
end;
suppose A195: k > 0 ; :: thesis: Fk1 . (p1,q1) >= 0
then Fk1 = ADD . (Fk,Nk1) by A184, A189;
then A196: Fk1 = Fk + Nk1 by A60;
Fk . (p1,q1) >= 0 by A187, A188, A195, NAT_1:13;
then 0 + 0 <= (Fk . (p1,q1)) + (Nk1 . (p1,q1)) by A190, A191, A193;
hence Fk1 . (p1,q1) >= 0 by A113, A196, NAGATA_1:def 7; :: thesis: verum
end;
end;
end;
let Fn be RealMap of [:T,T:]; :: thesis: ( Fn = F . (k + 1) implies Fn . (p1,q1) >= 0 )
assume Fn = F . (k + 1) ; :: thesis: Fn . (p1,q1) >= 0
hence Fn . (p1,q1) >= 0 by A194; :: thesis: verum
end;
A197: S10[ 0 ] ;
for n being Element of NAT holds S10[n] from NAT_1:sch 1(A197, A186);
hence ANoNoiS2 . (p1,q1) >= 0 by A182, A185; :: thesis: verum
end;
end;
end;
now
A198: AS2 . (p1,q1) <= AS1 . (p1,q1) by A113, A178, A170, A169, A171, A172, A168, XREAL_1:7;
let SumFdist1, SumFdist2 be RealMap of [:T,T:]; :: thesis: ( SumFdist1 = SumFdist . pq1 & SumFdist2 = SumFdist . pq2 implies SumFdist1 . pq1 >= SumFdist2 . pq1 )
assume that
A199: SumFdist1 = SumFdist . pq1 and
A200: SumFdist2 = SumFdist . pq2 ; :: thesis: SumFdist1 . pq1 >= SumFdist2 . pq1
SumFdist2 = AS2 by A59, A200;
hence SumFdist1 . pq1 >= SumFdist2 . pq1 by A59, A113, A199, A198; :: thesis: verum
end;
hence for SumFdist1, SumFdist2 being RealMap of [:T,T:] st SumFdist1 = SumFdist . pq1 & SumFdist2 = SumFdist . pq2 holds
SumFdist1 . pq1 >= SumFdist2 . pq1 ; :: thesis: verum
end;
now
let p, q, r be Point of T; :: thesis: ( SumFTS . (p,p) = 0 & SumFTS . (p,r) <= (SumFTS . (p,q)) + (SumFTS . (r,q)) )
thus SumFTS . (p,p) = 0 :: thesis: SumFTS . (p,r) <= (SumFTS . (p,q)) + (SumFTS . (r,q))
proof
reconsider pp = [p,p] as Point of [:T,T:] by BORSUK_1:def 2;
reconsider SF = SFdist . pp as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
A201: now
per cases ( len SF = 0 or len SF <> 0 ) ;
suppose A205: len SF <> 0 ; :: thesis: (ADD "**" SF) . pp = 0
then len SF >= 1 by NAT_1:14;
then consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A206: F . 1 = SF . 1 and
A207: for n being Element of NAT st 0 <> n & n < len SF holds
F . (n + 1) = ADD . ((F . n),(SF . (n + 1))) and
A208: ADD "**" SF = F . (len SF) by FINSOP_1:def 1;
defpred S10[ Element of NAT ] means ( $1 <> 0 & $1 <= len SF implies (F . $1) . pp = 0 );
A209: for k being Element of NAT st S10[k] holds
S10[k + 1]
proof
let k be Element of NAT ; :: thesis: ( S10[k] implies S10[k + 1] )
assume A210: S10[k] ; :: thesis: S10[k + 1]
consider x, y being Point of T such that
[x,y] = pp and
A211: rng SF = H4(H3(x) \/ H3(y)) by A57;
assume that
k + 1 <> 0 and
A212: k + 1 <= len SF ; :: thesis: (F . (k + 1)) . pp = 0
A213: k < len SF by A212, NAT_1:13;
k + 1 >= 1 by NAT_1:14;
then k + 1 in dom SF by A212, FINSEQ_3:25;
then SF . (k + 1) in H4(H3(x) \/ H3(y)) by A211, FUNCT_1:def 3;
then consider fd being RealMap of T such that
A214: Fdist . fd = SF . (k + 1) and
fd in H3(x) \/ H3(y) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then reconsider Fdistfd = Fdist . fd, Fk1 = F . (k + 1), Fk = F . k, SFk1 = SF . (k + 1) as RealMap of [:T,T:] by A214, FUNCT_2:5, FUNCT_2:66;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then A215: Fdistfd . (p,p) = abs ((fd . p) - (fd . p)) by A42;
per cases ( k = 0 or k > 0 ) ;
suppose k = 0 ; :: thesis: (F . (k + 1)) . pp = 0
hence (F . (k + 1)) . pp = 0 by A206, A214, A215, ABSVALUE:2; :: thesis: verum
end;
suppose A216: k > 0 ; :: thesis: (F . (k + 1)) . pp = 0
then Fk1 = ADD . (Fk,SFk1) by A207, A213;
then Fk1 = Fk + SFk1 by A60;
then Fk1 . pp = 0 + (SFk1 . pp) by A210, A212, A216, NAGATA_1:def 7, NAT_1:13;
hence (F . (k + 1)) . pp = 0 by A214, A215, ABSVALUE:2; :: thesis: verum
end;
end;
end;
A217: S10[ 0 ] ;
for n being Element of NAT holds S10[n] from NAT_1:sch 1(A217, A209);
hence (ADD "**" SF) . pp = 0 by A205, A208; :: thesis: verum
end;
end;
end;
SumFdist . pp = ADD "**" SF by A59;
hence SumFTS . (p,p) = 0 by A201, NAGATA_1:def 8; :: thesis: verum
end;
thus SumFTS . (p,r) <= (SumFTS . (p,q)) + (SumFTS . (r,q)) :: thesis: verum
proof
reconsider pr = [p,r], pq = [p,q], rq = [r,q] as Point of [:T,T:] by BORSUK_1:def 2;
reconsider SFpr = SFdist . pr as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
reconsider ASFpr = ADD "**" SFpr as RealMap of [:T,T:] by FUNCT_2:66;
reconsider SumFpr = SumFdist . pr, SumFpq = SumFdist . pq, SumFrq = SumFdist . rq as RealMap of [:T,T:] by FUNCT_2:66;
A218: ( SumFTS . pr = SumFpr . pr & SumFTS . pq = SumFpq . pq ) by NAGATA_1:def 8;
( SumFpr . pq <= SumFpq . pq & SumFpr . rq <= SumFrq . rq ) by A112;
then A219: (SumFpr . pq) + (SumFpr . rq) <= (SumFpq . pq) + (SumFrq . rq) by XREAL_1:7;
A220: now
per cases ( len SFpr = 0 or len SFpr <> 0 ) ;
suppose A225: len SFpr <> 0 ; :: thesis: ASFpr . pr <= (ASFpr . pq) + (ASFpr . rq)
then len SFpr >= 1 by NAT_1:14;
then consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A226: F . 1 = SFpr . 1 and
A227: for n being Element of NAT st 0 <> n & n < len SFpr holds
F . (n + 1) = ADD . ((F . n),(SFpr . (n + 1))) and
A228: ADD "**" SFpr = F . (len SFpr) by FINSOP_1:def 1;
defpred S10[ Element of NAT ] means ( $1 <> 0 & $1 <= len SFpr implies for F9 being RealMap of [:T,T:] st F9 = F . $1 holds
F9 . pr <= (F9 . pq) + (F9 . rq) );
A229: for k being Element of NAT st S10[k] holds
S10[k + 1]
proof
let k be Element of NAT ; :: thesis: ( S10[k] implies S10[k + 1] )
assume A230: S10[k] ; :: thesis: S10[k + 1]
consider x, y being Point of T such that
[x,y] = pr and
A231: rng SFpr = H4(H3(x) \/ H3(y)) by A57;
assume that
k + 1 <> 0 and
A232: k + 1 <= len SFpr ; :: thesis: for F9 being RealMap of [:T,T:] st F9 = F . (k + 1) holds
F9 . pr <= (F9 . pq) + (F9 . rq)

A233: k < len SFpr by A232, NAT_1:13;
k + 1 >= 1 by NAT_1:14;
then k + 1 in dom SFpr by A232, FINSEQ_3:25;
then SFpr . (k + 1) in H4(H3(x) \/ H3(y)) by A231, FUNCT_1:def 3;
then consider fd being RealMap of T such that
A234: Fdist . fd = SFpr . (k + 1) and
fd in H3(x) \/ H3(y) ;
fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then reconsider Fdistfd = Fdist . fd, Fk1 = F . (k + 1), Fk = F . k, SFk1 = SFpr . (k + 1) as RealMap of [:T,T:] by A234, FUNCT_2:5, FUNCT_2:66;
A235: (fd . p) - (fd . r) = ((fd . p) - (fd . q)) + ((fd . q) - (fd . r)) ;
then A236: abs ((fd . p) - (fd . r)) <= (abs ((fd . p) - (fd . q))) + (abs ((fd . q) - (fd . r))) by COMPLEX1:56;
A237: fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
then A238: ( Fdistfd . (p,r) = abs ((fd . p) - (fd . r)) & Fdistfd . (p,q) = abs ((fd . p) - (fd . q)) ) by A42;
A239: ( abs ((fd . q) - (fd . r)) = abs (- ((fd . q) - (fd . r))) & Fdistfd . (r,q) = abs ((fd . r) - (fd . q)) ) by A42, A237, COMPLEX1:52;
let F9 be RealMap of [:T,T:]; :: thesis: ( F9 = F . (k + 1) implies F9 . pr <= (F9 . pq) + (F9 . rq) )
assume A240: F9 = F . (k + 1) ; :: thesis: F9 . pr <= (F9 . pq) + (F9 . rq)
per cases ( k = 0 or k > 0 ) ;
suppose k = 0 ; :: thesis: F9 . pr <= (F9 . pq) + (F9 . rq)
hence F9 . pr <= (F9 . pq) + (F9 . rq) by A226, A234, A235, A238, A239, A240, COMPLEX1:56; :: thesis: verum
end;
suppose A241: k > 0 ; :: thesis: F9 . pr <= (F9 . pq) + (F9 . rq)
then Fk . pr <= (Fk . pq) + (Fk . rq) by A230, A232, NAT_1:13;
then A242: (Fk . pr) + (SFk1 . pr) <= ((Fk . pq) + (Fk . rq)) + ((SFk1 . pq) + (SFk1 . rq)) by A234, A236, A238, A239, XREAL_1:7;
Fk1 = ADD . (Fk,SFk1) by A227, A233, A241;
then A243: Fk1 = Fk + SFk1 by A60;
then ( Fk1 . pq = (Fk . pq) + (SFk1 . pq) & Fk1 . rq = (Fk . rq) + (SFk1 . rq) ) by NAGATA_1:def 7;
hence F9 . pr <= (F9 . pq) + (F9 . rq) by A240, A243, A242, NAGATA_1:def 7; :: thesis: verum
end;
end;
end;
A244: S10[ 0 ] ;
for n being Element of NAT holds S10[n] from NAT_1:sch 1(A244, A229);
hence ASFpr . pr <= (ASFpr . pq) + (ASFpr . rq) by A225, A228; :: thesis: verum
end;
end;
end;
SumFpr = ADD "**" SFpr by A59;
then SumFpr . pr <= (SumFpq . pq) + (SumFrq . rq) by A220, A219, XXREAL_0:2;
hence SumFTS . (p,r) <= (SumFTS . (p,q)) + (SumFTS . (r,q)) by A218, NAGATA_1:def 8; :: thesis: verum
end;
end;
then A245: SumFTS is_a_pseudometric_of the carrier of T by NAGATA_1:28;
A246: for p being Point of T
for fd being Element of Funcs ( the carrier of T,REAL) st fd in H3(p) holds
( S4[fd,Fdist . fd] & Fdist . fd is continuous RealMap of [:T,T:] )
proof
let p be Point of T; :: thesis: for fd being Element of Funcs ( the carrier of T,REAL) st fd in H3(p) holds
( S4[fd,Fdist . fd] & Fdist . fd is continuous RealMap of [:T,T:] )

let fd be Element of Funcs ( the carrier of T,REAL); :: thesis: ( fd in H3(p) implies ( S4[fd,Fdist . fd] & Fdist . fd is continuous RealMap of [:T,T:] ) )
reconsider FD = Fdist . fd as RealMap of [:T,T:] by FUNCT_2:66;
assume fd in H3(p) ; :: thesis: ( S4[fd,Fdist . fd] & Fdist . fd is continuous RealMap of [:T,T:] )
then consider A being Subset of T such that
A247: fd = Fn . A and
A248: A in Bn . n and
A in H2(Sx . p) ;
A249: S4[fd,Fdist . fd] by A42;
S6[A,Fn . A] by A24, A248;
then FD is continuous by A247, A249, NAGATA_1:21;
hence ( S4[fd,Fdist . fd] & Fdist . fd is continuous RealMap of [:T,T:] ) by A42; :: thesis: verum
end;
A250: for pq9 being Point of [:T,T:] holds SumFdist . pq9 is continuous RealMap of [:T,T:]
proof
let pq9 be Point of [:T,T:]; :: thesis: SumFdist . pq9 is continuous RealMap of [:T,T:]
reconsider SF = SFdist . pq9 as FinSequence of Funcs ( the carrier of [:T,T:],REAL) by FINSEQ_1:def 11;
consider p, q being Point of T such that
[p,q] = pq9 and
A251: rng SF = H4(H3(p) \/ H3(q)) by A57;
for n being Element of NAT st 0 <> n & n <= len SF holds
SF . n is continuous RealMap of [:T,T:]
proof
let n be Element of NAT ; :: thesis: ( 0 <> n & n <= len SF implies SF . n is continuous RealMap of [:T,T:] )
assume that
A252: 0 <> n and
A253: n <= len SF ; :: thesis: SF . n is continuous RealMap of [:T,T:]
n >= 1 by A252, NAT_1:14;
then n in dom SF by A253, FINSEQ_3:25;
then SF . n in H4(H3(p) \/ H3(q)) by A251, FUNCT_1:def 3;
then consider fd being RealMap of T such that
A254: SF . n = Fdist . fd and
A255: fd in H3(p) \/ H3(q) ;
A256: fd in Funcs ( the carrier of T,REAL) by FUNCT_2:8;
( fd in H3(p) or fd in H3(q) ) by A255, XBOOLE_0:def 3;
hence SF . n is continuous RealMap of [:T,T:] by A246, A254, A256; :: thesis: verum
end;
then ADD "**" SF is continuous RealMap of [:T,T:] by A60, NAGATA_1:25;
hence SumFdist . pq9 is continuous RealMap of [:T,T:] by A59; :: thesis: verum
end;
A257: for pq9 being Point of [:T,T:] holds SumFdist9 . pq9 is continuous Function of [:T,T:],R^1
proof
let pq9 be Point of [:T,T:]; :: thesis: SumFdist9 . pq9 is continuous Function of [:T,T:],R^1
reconsider SF = SumFdist . pq9 as Function of [:T,T:],R^1 by A250, TOPMETR:17;
SumFdist . pq9 is continuous RealMap of [:T,T:] by A250;
then SF is continuous by TOPREAL6:74;
hence SumFdist9 . pq9 is continuous Function of [:T,T:],R^1 ; :: thesis: verum
end;
take min (1,SumFTS9) ; :: thesis: S1[n,m, min (1,SumFTS9)]
A258: for p, q being Point of T holds (min (1,SumFTS9)) . [p,q] <= 1
proof
let p, q be Point of T; :: thesis: (min (1,SumFTS9)) . [p,q] <= 1
the carrier of [:T,T:] = [: the carrier of T, the carrier of T:] by BORSUK_1:def 2;
then (min (1,SumFTS9)) . [p,q] = min (1,(SumFTS9 . [p,q])) by NAGATA_1:def 9;
hence (min (1,SumFTS9)) . [p,q] <= 1 by XXREAL_0:17; :: thesis: verum
end;
for p, q being Point of [:T,T:] st p in SS . q holds
(SumFdist9 . p) . p = (SumFdist9 . q) . p by A112;
then SumFdist9 Toler is continuous by A257, A32, NAGATA_1:26;
then SumFTS9 is continuous by TOPREAL6:74;
then ( min (1,SumFTS9) = min (1,SumFTS) & min (1,SumFTS9) is continuous ) by BORSUK_1:def 2, NAGATA_1:27;
hence S1[n,m, min (1,SumFTS9)] by A245, A258, A109, NAGATA_1:30; :: thesis: verum
end;
A259: for k being set st k in NAT holds
ex f being set st
( f in Funcs ( the carrier of [:T,T:],REAL) & S2[k,f] )
proof
A260: NAT = rng PairFunc by Th2, FUNCT_2:def 3;
let k be set ; :: thesis: ( k in NAT implies ex f being set st
( f in Funcs ( the carrier of [:T,T:],REAL) & S2[k,f] ) )

assume k in NAT ; :: thesis: ex f being set st
( f in Funcs ( the carrier of [:T,T:],REAL) & S2[k,f] )

then consider nm being set such that
A261: nm in dom PairFunc and
A262: k = PairFunc . nm by A260, FUNCT_1:def 3;
consider n, m being set such that
A263: ( n in NAT & m in NAT ) and
A264: nm = [n,m] by A261, ZFMISC_1:def 2;
consider pmet9 being RealMap of [:T,T:] such that
A265: S1[n,m,pmet9] by A7, A263;
take pmet9 ; :: thesis: ( pmet9 in Funcs ( the carrier of [:T,T:],REAL) & S2[k,pmet9] )
thus pmet9 in Funcs ( the carrier of [:T,T:],REAL) by FUNCT_2:8; :: thesis: S2[k,pmet9]
take pm = pmet9; :: thesis: ( pm = pmet9 & ( for n, m being Element of NAT st (PairFunc ") . k = [n,m] holds
S1[n,m,pm] ) )

thus pm = pmet9 ; :: thesis: for n, m being Element of NAT st (PairFunc ") . k = [n,m] holds
S1[n,m,pm]

let n1, m1 be Element of NAT ; :: thesis: ( (PairFunc ") . k = [n1,m1] implies S1[n1,m1,pm] )
assume (PairFunc ") . k = [n1,m1] ; :: thesis: S1[n1,m1,pm]
then [n1,m1] = [n,m] by A261, A262, A264, Lm2, Th2, FUNCT_1:32;
then ( n1 = n & m1 = m ) by ZFMISC_1:27;
hence S1[n1,m1,pm] by A265; :: thesis: verum
end;
consider F being Function of NAT,(Funcs ( the carrier of [:T,T:],REAL)) such that
A266: for n being set st n in NAT holds
S2[n,F . n] from FUNCT_2:sch 1(A259);
A267: now
let n be Element of NAT ; :: thesis: F . n is PartFunc of [: the carrier of T, the carrier of T:],REAL
[: the carrier of T, the carrier of T:] = the carrier of [:T,T:] by BORSUK_1:def 2;
hence F . n is PartFunc of [: the carrier of T, the carrier of T:],REAL by FUNCT_2:66; :: thesis: verum
end;
dom F = NAT by FUNCT_2:def 1;
then reconsider F9 = F as Functional_Sequence of [: the carrier of T, the carrier of T:],REAL by A267, SEQFUNC:1;
A268: for p being Point of T
for A9 being non empty Subset of T st not p in A9 & A9 is closed holds
ex k being Element of NAT st
for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . k = pmet holds
(lower_bound (pmet,A9)) . p > 0
proof
let p be Point of T; :: thesis: for A9 being non empty Subset of T st not p in A9 & A9 is closed holds
ex k being Element of NAT st
for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . k = pmet holds
(lower_bound (pmet,A9)) . p > 0

let A9 be non empty Subset of T; :: thesis: ( not p in A9 & A9 is closed implies ex k being Element of NAT st
for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . k = pmet holds
(lower_bound (pmet,A9)) . p > 0 )

assume that
A269: not p in A9 and
A270: A9 is closed ; :: thesis: ex k being Element of NAT st
for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . k = pmet holds
(lower_bound (pmet,A9)) . p > 0

set O = A9 ` ;
p in A9 ` by A269, XBOOLE_0:def 5;
then consider U being Subset of T such that
A271: p in U and
A272: Cl U c= A9 ` and
A273: U in Union Bn by A1, A5, A270, NAGATA_1:19;
Union Bn c= the topology of T by A5, TOPS_2:64;
then reconsider U = U as open Subset of T by A273, PRE_TOPC:def 2;
consider n being Element of NAT such that
A274: U in Bn . n by A273, PROB_1:12;
consider W being Subset of T such that
A275: ( p in W & Cl W c= U ) and
A276: W in Union Bn by A1, A5, A271, NAGATA_1:19;
Union Bn c= the topology of T by A5, TOPS_2:64;
then reconsider W = W as open Subset of T by A276, PRE_TOPC:def 2;
consider m being Element of NAT such that
A277: W in Bn . m by A276, PROB_1:12;
set k = PairFunc . [n,m];
consider G being RealMap of [:T,T:] such that
A278: G = F . (PairFunc . [n,m]) and
A279: for n, m being Element of NAT st (PairFunc ") . (PairFunc . [n,m]) = [n,m] holds
S1[n,m,G] by A266;
dom PairFunc = [:NAT,NAT:] by FUNCT_2:def 1;
then [n,m] = (PairFunc ") . (PairFunc . [n,m]) by Lm2, Th2, FUNCT_1:32;
then consider pmet being Function of [: the carrier of T, the carrier of T:],REAL such that
A280: G = pmet and
G is continuous and
pmet is_a_pseudometric_of the carrier of T and
A281: for p, q being Point of T holds
( pmet . [p,q] <= 1 & ( for p, q being Point of T st ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) holds
pmet . [p,q] = 1 ) ) by A279;
A282: for rn being real number st rn in (dist (pmet,p)) .: A9 holds
rn >= 1
proof
let rn be real number ; :: thesis: ( rn in (dist (pmet,p)) .: A9 implies rn >= 1 )
assume rn in (dist (pmet,p)) .: A9 ; :: thesis: rn >= 1
then consider a being set such that
A283: a in dom (dist (pmet,p)) and
A284: a in A9 and
A285: rn = (dist (pmet,p)) . a by FUNCT_1:def 6;
reconsider a = a as Point of T by A283;
A286: pmet . (p,a) = (dist (pmet,p)) . a by Def2;
U c= Cl U by PRE_TOPC:18;
then U c= A9 ` by A272, XBOOLE_1:1;
then U misses A9 by SUBSET_1:23;
then not a in U by A284, XBOOLE_0:3;
hence rn >= 1 by A275, A274, A277, A281, A285, A286; :: thesis: verum
end;
take PairFunc . [n,m] ; :: thesis: for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . (PairFunc . [n,m]) = pmet holds
(lower_bound (pmet,A9)) . p > 0

the carrier of T = dom (dist (pmet,p)) by FUNCT_2:def 1;
then lower_bound ((dist (pmet,p)) .: A9) >= 1 by A282, SEQ_4:43;
hence for pmet being Function of [: the carrier of T, the carrier of T:],REAL st F9 . (PairFunc . [n,m]) = pmet holds
(lower_bound (pmet,A9)) . p > 0 by A278, A280, Def3; :: thesis: verum
end;
for k being Element of NAT ex pmet being Function of [: the carrier of T, the carrier of T:],REAL st
( F9 . k = pmet & pmet is_a_pseudometric_of the carrier of T & ( for pq being Element of [: the carrier of T, the carrier of T:] holds pmet . pq <= 1 ) & ( for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous ) )
proof
let k be Element of NAT ; :: thesis: ex pmet being Function of [: the carrier of T, the carrier of T:],REAL st
( F9 . k = pmet & pmet is_a_pseudometric_of the carrier of T & ( for pq being Element of [: the carrier of T, the carrier of T:] holds pmet . pq <= 1 ) & ( for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous ) )

consider Fk being RealMap of [:T,T:] such that
A287: Fk = F . k and
A288: for n, m being Element of NAT st (PairFunc ") . k = [n,m] holds
S1[n,m,Fk] by A266;
NAT = rng PairFunc by Th2, FUNCT_2:def 3;
then consider nm being set such that
A289: nm in dom PairFunc and
A290: k = PairFunc . nm by FUNCT_1:def 3;
consider n, m being set such that
A291: ( n in NAT & m in NAT ) and
A292: nm = [n,m] by A289, ZFMISC_1:def 2;
[n,m] = (PairFunc ") . k by A289, A290, A292, Lm2, Th2, FUNCT_1:32;
then consider pmet being Function of [: the carrier of T, the carrier of T:],REAL such that
A293: Fk = pmet and
A294: Fk is continuous and
A295: pmet is_a_pseudometric_of the carrier of T and
A296: for p, q being Point of T holds
( pmet . [p,q] <= 1 & ( for p, q being Point of T st ex A, B being Subset of T st
( A is open & B is open & A in Bn . m & B in Bn . n & p in A & Cl A c= B & not q in B ) holds
pmet . [p,q] = 1 ) ) by A291, A288;
take pmet ; :: thesis: ( F9 . k = pmet & pmet is_a_pseudometric_of the carrier of T & ( for pq being Element of [: the carrier of T, the carrier of T:] holds pmet . pq <= 1 ) & ( for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous ) )

thus ( F9 . k = pmet & pmet is_a_pseudometric_of the carrier of T ) by A287, A293, A295; :: thesis: ( ( for pq being Element of [: the carrier of T, the carrier of T:] holds pmet . pq <= 1 ) & ( for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous ) )

thus for pq being Element of [: the carrier of T, the carrier of T:] holds pmet . pq <= 1 :: thesis: for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous
proof
let pq be Element of [: the carrier of T, the carrier of T:]; :: thesis: pmet . pq <= 1
ex p, q being set st
( p in the carrier of T & q in the carrier of T & pq = [p,q] ) by ZFMISC_1:def 2;
hence pmet . pq <= 1 by A296; :: thesis: verum
end;
thus for pmet9 being RealMap of [:T,T:] st pmet = pmet9 holds
pmet9 is continuous by A293, A294; :: thesis: verum
end;
hence T is metrizable by A2, A268, Th17; :: thesis: verum
end;
thus ( T is metrizable implies ( T is regular & T is T_1 & ex Bn being FamilySequence of T st Bn is Basis_sigma_locally_finite ) ) by NAGATA_1:15, NAGATA_1:16; :: thesis: verum