:: JORDAN1C semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm2:
for a, b, c being real number st a <> 0 & b <> 0 holds
(a / b) * ((c / a) * b) = c
Lm3:
for p being Point of (TOP-REAL 2) holds p is Point of (Euclid 2)
Lm4:
for r being real number st r > 0 holds
2 * (r / 4) < r
theorem :: JORDAN1C:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th2: :: JORDAN1C:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
C being
Simple_closed_curve for
i,
j,
n being
Nat st
[i,j] in Indices (Gauge C,n) &
[(i + 1),j] in Indices (Gauge C,n) holds
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 2,1) = (((Gauge C,n) * (i + 1),j) `1 ) - (((Gauge C,n) * i,j) `1 )
theorem Th3: :: JORDAN1C:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
C being
Simple_closed_curve for
i,
j,
n being
Nat st
[i,j] in Indices (Gauge C,n) &
[i,(j + 1)] in Indices (Gauge C,n) holds
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 1,2) = (((Gauge C,n) * i,(j + 1)) `2 ) - (((Gauge C,n) * i,j) `2 )
TopSpaceMetr (Euclid 2) = TOP-REAL 2
by EUCLID:def 8;
then Lm5:
TOP-REAL 2 = TopStruct(# the carrier of (Euclid 2),(Family_open_set (Euclid 2)) #)
by PCOMPS_1:def 6;
Lm6:
for C being Simple_closed_curve
for i, n, j being Nat
for p being Point of (TOP-REAL 2)
for r being real number
for q being Point of (Euclid 2) st 1 <= i & i + 1 <= len (Gauge C,n) & 1 <= j & j + 1 <= width (Gauge C,n) & r > 0 & p = q & dist ((Gauge C,n) * 1,1),((Gauge C,n) * 1,2) < r / 4 & dist ((Gauge C,n) * 1,1),((Gauge C,n) * 2,1) < r / 4 & p in cell (Gauge C,n),i,j & (Gauge C,n) * i,j in Ball q,r & (Gauge C,n) * (i + 1),j in Ball q,r & (Gauge C,n) * i,(j + 1) in Ball q,r & (Gauge C,n) * (i + 1),(j + 1) in Ball q,r holds
cell (Gauge C,n),i,j c= Ball q,r
theorem Th4: :: JORDAN1C:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1C:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm7:
for p being Point of (TOP-REAL 2)
for X being Subset of (TOP-REAL 2) st p in X & X is Bounded holds
( inf (proj1 || X) <= p `1 & p `1 <= sup (proj1 || X) )
Lm8:
for p being Point of (TOP-REAL 2)
for X being Subset of (TOP-REAL 2) st p in X & X is Bounded holds
( inf (proj2 || X) <= p `2 & p `2 <= sup (proj2 || X) )
theorem Th6: :: JORDAN1C:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1C:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm9:
for C being Subset of (TOP-REAL 2) st C is Bounded holds
for h being real number st BDD C <> {} & h > W-bound (BDD C) holds
ex p being Point of (TOP-REAL 2) st
( p in BDD C & not p `1 >= h )
Lm10:
for C being Subset of (TOP-REAL 2) st C is Bounded holds
for h being real number st BDD C <> {} & h < E-bound (BDD C) holds
ex p being Point of (TOP-REAL 2) st
( p in BDD C & not p `1 <= h )
Lm11:
for C being Subset of (TOP-REAL 2) st C is Bounded holds
for h being real number st BDD C <> {} & h < N-bound (BDD C) holds
ex p being Point of (TOP-REAL 2) st
( p in BDD C & not p `2 <= h )
Lm12:
for C being Subset of (TOP-REAL 2) st C is Bounded holds
for h being real number st BDD C <> {} & h > S-bound (BDD C) holds
ex p being Point of (TOP-REAL 2) st
( p in BDD C & not p `2 >= h )
theorem Th8: :: JORDAN1C:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th9: :: JORDAN1C:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th10: :: JORDAN1C:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th11: :: JORDAN1C:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th12: :: JORDAN1C:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th13: :: JORDAN1C:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th14: :: JORDAN1C:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: JORDAN1C:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: JORDAN1C:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th17: :: JORDAN1C:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th18: :: JORDAN1C:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th19: :: JORDAN1C:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th20: :: JORDAN1C:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th21: :: JORDAN1C:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th22: :: JORDAN1C:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th23: :: JORDAN1C:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th24: :: JORDAN1C:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th25: :: JORDAN1C:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th26: :: JORDAN1C:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th27: :: JORDAN1C:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th28: :: JORDAN1C:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th29: :: JORDAN1C:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th30: :: JORDAN1C:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
C being
Simple_closed_curve for
n,
i,
j being
Nat for
p,
q being
Point of
(TOP-REAL 2) for
r being
real number st
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 1,2) < r &
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 2,1) < r &
p in cell (Gauge C,n),
i,
j &
q in cell (Gauge C,n),
i,
j & 1
<= i &
i + 1
<= len (Gauge C,n) & 1
<= j &
j + 1
<= width (Gauge C,n) holds
dist p,
q < 2
* r
theorem :: JORDAN1C:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1C:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1C:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th34: :: JORDAN1C:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1C:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
C being
Simple_closed_curve for
p being
Point of
(TOP-REAL 2) st
p in BDD C holds
ex
n,
i,
j being
Nat st
( 1
< i &
i < len (Gauge C,n) & 1
< j &
j < width (Gauge C,n) &
p `1 <> ((Gauge C,n) * i,j) `1 &
p in cell (Gauge C,n),
i,
j &
cell (Gauge C,n),
i,
j c= BDD C )
theorem :: JORDAN1C:36
:: Showing IDV graph ... (Click the Palm Tree again to close it) 