:: HAUSDORF semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: HAUSDORF:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: HAUSDORF:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: HAUSDORF:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: HAUSDORF:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: HAUSDORF:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th6: :: HAUSDORF:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: HAUSDORF:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: HAUSDORF:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th9: :: HAUSDORF:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th10: :: HAUSDORF:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th11: :: HAUSDORF:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th12: :: HAUSDORF:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th13: :: HAUSDORF:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th14: :: HAUSDORF:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: HAUSDORF:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: HAUSDORF:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th17: :: HAUSDORF:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th18: :: HAUSDORF:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th19: :: HAUSDORF:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th21: :: HAUSDORF:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm1:
for M being non empty MetrSpace
for P being non empty Subset of (TopSpaceMetr M)
for x being Point of M
for X being Subset of REAL st X = (dist x) .: P & P is compact holds
X is bounded_above
theorem Th22: :: HAUSDORF:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th24: :: HAUSDORF:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th25: :: HAUSDORF:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th27: :: HAUSDORF:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th29: :: HAUSDORF:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th30: :: HAUSDORF:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th31: :: HAUSDORF:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th33: :: HAUSDORF:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
definition
let M be non
empty MetrSpace;
let P,
Q be
Subset of
(TopSpaceMetr M);
func HausDist P,
Q -> Real equals :: HAUSDORF:def 1
max (max_dist_min P,Q),
(max_dist_min Q,P);
coherence
max (max_dist_min P,Q),(max_dist_min Q,P) is Real
;
commutativity
for b1 being Real
for P, Q being Subset of (TopSpaceMetr M) st b1 = max (max_dist_min P,Q),(max_dist_min Q,P) holds
b1 = max (max_dist_min Q,P),(max_dist_min P,Q)
;
end;
:: deftheorem defines HausDist HAUSDORF:def 1 :
theorem Th34: :: HAUSDORF:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th35: :: HAUSDORF:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th36: :: HAUSDORF:36
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th37: :: HAUSDORF:37
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th38: :: HAUSDORF:38
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th39: :: HAUSDORF:39
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th40: :: HAUSDORF:40
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
definition
let n be
Nat;
let P,
Q be
Subset of
(TOP-REAL n);
func max_dist_min P,
Q -> Real means :: HAUSDORF:def 2
ex
P',
Q' being
Subset of
(TopSpaceMetr (Euclid n)) st
(
P = P' &
Q = Q' &
it = max_dist_min P',
Q' );
existence
ex b1 being Real ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b1 = max_dist_min P',Q' )
uniqueness
for b1, b2 being Real st ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b1 = max_dist_min P',Q' ) & ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b2 = max_dist_min P',Q' ) holds
b1 = b2
;
end;
:: deftheorem defines max_dist_min HAUSDORF:def 2 :
definition
let n be
Nat;
let P,
Q be
Subset of
(TOP-REAL n);
func HausDist P,
Q -> Real means :
Def3:
:: HAUSDORF:def 3
ex
P',
Q' being
Subset of
(TopSpaceMetr (Euclid n)) st
(
P = P' &
Q = Q' &
it = HausDist P',
Q' );
existence
ex b1 being Real ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b1 = HausDist P',Q' )
uniqueness
for b1, b2 being Real st ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b1 = HausDist P',Q' ) & ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b2 = HausDist P',Q' ) holds
b1 = b2
;
commutativity
for b1 being Real
for P, Q being Subset of (TOP-REAL n) st ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( P = P' & Q = Q' & b1 = HausDist P',Q' ) holds
ex P', Q' being Subset of (TopSpaceMetr (Euclid n)) st
( Q = P' & P = Q' & b1 = HausDist P',Q' )
;
end;
:: deftheorem Def3 defines HausDist HAUSDORF:def 3 :
theorem :: HAUSDORF:41
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:42
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:43
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: HAUSDORF:44
:: Showing IDV graph ... (Click the Palm Tree again to close it) 