:: PCOMPS_1 semantic presentation

theorem Th1: :: PCOMPS_1:1

for PM being MetrStruct
for x being Element of PM
for r, p being real number st r <= p holds
Ball x,r c= Ball x,p

proof end;

theorem Th2: :: PCOMPS_1:2

for T being TopSpace
for A being Subset of T holds
( Cl A <> {} iff A <> {} )

proof end;

theorem :: PCOMPS_1:3

canceled;

theorem :: PCOMPS_1:4

canceled;

theorem Th5: :: PCOMPS_1:5

for T being non empty TopSpace
for FX being Subset-Family of T st FX is_a_cover_of T holds
for x being Point of T ex W being Subset of T st
( x in W & W in FX )

proof end;

definition

let X be set ;
:: original: bool
redefine func bool X -> Subset-Family of X;
coherence by ZFMISC_1:def 1;

end;

definition

let D be set ;
func 1TopSp D -> TopStruct equals :: PCOMPS_1:def 1
TopStruct(# D,(bool D) #);
coherence ;

end;

:: deftheorem defines 1TopSp PCOMPS_1:def 1 :

registration

let D be set ;
cluster 1TopSp D -> strict TopSpace-like ;
coherence

proof end;

end;

registration

let D be non empty set ;
cluster 1TopSp D -> non empty strict TopSpace-like ;
coherence ;

end;

theorem :: PCOMPS_1:6

canceled;

theorem :: PCOMPS_1:7

for a being set holds the topology of (1TopSp a) = bool a ;

theorem :: PCOMPS_1:8

for a being set holds the carrier of (1TopSp a) = a ;

theorem Th9: :: PCOMPS_1:9

for a being set holds 1TopSp {a} is compact

proof end;

theorem Th10: :: PCOMPS_1:10

for T being non empty TopSpace
for x being Point of T st T is_T2 holds
{x} is closed

proof end;

definition

let T be TopStruct ;
let IT be Subset-Family of T;
attr IT is locally_finite means :Def2: :: PCOMPS_1:def 2
for x being Point of T ex W being Subset of T st
( x in W & W is open & { V where V is Subset of T : ( V in IT & V meets W ) } is finite );

end;

:: deftheorem Def2 defines locally_finite PCOMPS_1:def 2 :

theorem Th11: :: PCOMPS_1:11

for T being non empty TopSpace
for FX being Subset-Family of T
for W being Subset of T holds { V where V is Subset of T : ( V in FX & V meets W ) } c= FX

proof end;

theorem Th12: :: PCOMPS_1:12

for T being non empty TopSpace
for FX, GX being Subset-Family of T st FX c= GX & GX is locally_finite holds
FX is locally_finite

proof end;

theorem Th13: :: PCOMPS_1:13

for T being non empty TopSpace
for FX being Subset-Family of T st FX is finite holds
FX is locally_finite

proof end;

definition

let T be TopStruct ;
let FX be Subset-Family of T;
func clf FX -> Subset-Family of T means :Def3: :: PCOMPS_1:def 3
for Z being Subset of T holds
( Z in it iff ex W being Subset of T st
( Z = Cl W & W in FX ) );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def3 defines clf PCOMPS_1:def 3 :

theorem :: PCOMPS_1:14

for T being TopSpace
for FX being Subset-Family of T holds clf FX is closed

proof end;

theorem Th15: :: PCOMPS_1:15

for T being TopSpace
for FX being Subset-Family of T st FX = {} holds
clf FX = {}

proof end;

theorem Th16: :: PCOMPS_1:16

for T being non empty TopSpace
for V being Subset of T
for FX being Subset-Family of T st FX = {V} holds
clf FX = {(Cl V)}

proof end;

theorem Th17: :: PCOMPS_1:17

for T being non empty TopSpace
for FX, GX being Subset-Family of T st FX c= GX holds
clf FX c= clf GX

proof end;

theorem Th18: :: PCOMPS_1:18

for T being non empty TopSpace
for FX, GX being Subset-Family of T holds clf (FX \/ GX) = (clf FX) \/ (clf GX)

proof end;

theorem Th19: :: PCOMPS_1:19

for T being non empty TopSpace
for FX being Subset-Family of T st FX is finite holds
Cl (union FX) = union (clf FX)

proof end;

theorem Th20: :: PCOMPS_1:20

for T being non empty TopSpace
for FX being Subset-Family of T holds FX is_finer_than clf FX

proof end;

scheme :: PCOMPS_1:sch 1
Lambda1top{ F₁() -> TopSpace, F₂() -> Subset-Family of F₁(), F₃() -> Subset-Family of F₁(), F₄( set ) -> Subset of F₁() } :

ex f being Function of F₂(),F₃() st
for Z being Subset of F₁() st Z in F₂() holds
f . Z = F₄(Z)

provided

A1: for Z being Subset of F₁() st Z in F₂() holds
F₄(Z) in F₃()

proof end;

theorem :: PCOMPS_1:21

for T being non empty TopSpace
for FX being Subset-Family of T st FX is locally_finite holds
clf FX is locally_finite

proof end;

theorem Th22: :: PCOMPS_1:22

for T being non empty TopSpace
for FX being Subset-Family of T holds union FX c= union (clf FX)

proof end;

theorem Th23: :: PCOMPS_1:23

for T being non empty TopSpace
for FX being Subset-Family of T st FX is locally_finite holds
Cl (union FX) = union (clf FX)

proof end;

theorem :: PCOMPS_1:24

for T being non empty TopSpace
for FX being Subset-Family of T st FX is locally_finite & FX is closed holds
union FX is closed

proof end;

definition

let IT be TopStruct ;
attr IT is paracompact means :Def4: :: PCOMPS_1:def 4
for FX being Subset-Family of IT st FX is_a_cover_of IT & FX is open holds
ex GX being Subset-Family of IT st
( GX is open & GX is_a_cover_of IT & GX is_finer_than FX & GX is locally_finite );

end;

:: deftheorem Def4 defines paracompact PCOMPS_1:def 4 :

registration

cluster non empty paracompact TopStruct ;
existence

proof end;

end;

theorem :: PCOMPS_1:25

for T being non empty TopSpace st T is compact holds
T is paracompact

proof end;

theorem Th26: :: PCOMPS_1:26

for T being non empty TopSpace
for A, B being Subset of T st T is paracompact & A is closed & B is closed & A misses B & ( for x being Point of T st x in B holds
ex V, W being Subset of T st
( V is open & W is open & A c= V & x in W & V misses W ) ) holds
ex Y, Z being Subset of T st
( Y is open & Z is open & A c= Y & B c= Z & Y misses Z )

proof end;

theorem Th27: :: PCOMPS_1:27

for T being non empty TopSpace st T is_T2 & T is paracompact holds
T is_T3

proof end;

theorem :: PCOMPS_1:28

for T being non empty TopSpace st T is_T2 & T is paracompact holds
T is_T4

proof end;

definition

let PM be MetrStruct ;
func Family_open_set PM -> Subset-Family of PM means :Def5: :: PCOMPS_1:def 5
for V being Subset of PM holds
( V in it iff for x being Element of PM st x in V holds
ex r being Real st
( r > 0 & Ball x,r c= V ) );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def5 defines Family_open_set PCOMPS_1:def 5 :

theorem Th29: :: PCOMPS_1:29

for PM being MetrStruct
for x being Element of PM ex r being Real st
( r > 0 & Ball x,r c= the carrier of PM )

proof end;

theorem Th30: :: PCOMPS_1:30

for PM being MetrStruct
for y, x being Element of PM
for r being real number st PM is triangle & y in Ball x,r holds
ex p being Real st
( p > 0 & Ball y,p c= Ball x,r )

proof end;

theorem :: PCOMPS_1:31

for PM being MetrStruct
for r, p being Real
for y, x, z being Element of PM st PM is triangle & y in (Ball x,r) /\ (Ball z,p) holds
ex q being Real st
( Ball y,q c= Ball x,r & Ball y,q c= Ball z,p )

proof end;

theorem :: PCOMPS_1:32

canceled;

theorem Th33: :: PCOMPS_1:33

for PM being MetrStruct
for x being Element of PM
for r being real number st PM is triangle holds
Ball x,r in Family_open_set PM

proof end;

theorem Th34: :: PCOMPS_1:34

for PM being MetrStruct holds the carrier of PM in Family_open_set PM

proof end;

theorem Th35: :: PCOMPS_1:35

for PM being MetrStruct
for V, W being Subset of PM st V in Family_open_set PM & W in Family_open_set PM holds
V /\ W in Family_open_set PM

proof end;

theorem Th36: :: PCOMPS_1:36

for PM being MetrStruct
for A being Subset-Family of PM st A c= Family_open_set PM holds
union A in Family_open_set PM

proof end;

theorem Th37: :: PCOMPS_1:37

for PM being MetrStruct holds TopStruct(# the carrier of PM,(Family_open_set PM) #) is TopSpace

proof end;

definition

let PM be MetrStruct ;
func TopSpaceMetr PM -> TopStruct equals :: PCOMPS_1:def 6
TopStruct(# the carrier of PM,(Family_open_set PM) #);
coherence ;

end;

:: deftheorem defines TopSpaceMetr PCOMPS_1:def 6 :

registration

let PM be MetrStruct ;
cluster TopSpaceMetr PM -> strict TopSpace-like ;
coherence by Th37;

end;

registration

let PM be non empty MetrStruct ;
cluster TopSpaceMetr PM -> non empty strict TopSpace-like ;
coherence ;

end;

theorem Th38: :: PCOMPS_1:38

for PM being non empty MetrSpace holds TopSpaceMetr PM is_T2

proof end;

registration

cluster non empty strict being_T2 TopStruct ;
existence

proof end;

end;

definition

let D be set ;
let f be Function of [:D,D:], REAL ;
pred f is_metric_of D means :Def7: :: PCOMPS_1:def 7
for a, b, c being Element of D holds
( ( f . a,b = 0 implies a = b ) & ( a = b implies f . a,b = 0 ) & f . a,b = f . b,a & f . a,c <= (f . a,b) + (f . b,c) );

end;

:: deftheorem Def7 defines is_metric_of PCOMPS_1:def 7 :

theorem Th39: :: PCOMPS_1:39

for D being set
for f being Function of [:D,D:], REAL holds
( f is_metric_of D iff MetrStruct(# D,f #) is MetrSpace )

proof end;

definition

let D be non empty set ;
let f be Function of [:D,D:], REAL ;
assume A1: f is_metric_of D ;
func SpaceMetr D,f -> non empty strict MetrSpace equals :Def8: :: PCOMPS_1:def 8
MetrStruct(# D,f #);
coherence by A1, Th39;

end;

:: deftheorem Def8 defines SpaceMetr PCOMPS_1:def 8 :

definition

let IT be non empty TopStruct ;
attr IT is metrizable means :: PCOMPS_1:def 9
ex f being Function of [:the carrier of IT,the carrier of IT:], REAL st
( f is_metric_of the carrier of IT & Family_open_set (SpaceMetr the carrier of IT,f) = the topology of IT );

end;

:: deftheorem defines metrizable PCOMPS_1:def 9 :

registration

cluster non empty strict metrizable TopStruct ;
existence

proof end;

end;