:: JORDAN1I semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: JORDAN1I:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: JORDAN1I:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: JORDAN1I:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th4: :: JORDAN1I:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th5: :: JORDAN1I:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: JORDAN1I:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th11: :: JORDAN1I:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th12: :: JORDAN1I:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th13: :: JORDAN1I:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th14: :: JORDAN1I:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: JORDAN1I:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: JORDAN1I:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th17: :: JORDAN1I:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th18: :: JORDAN1I:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th19: :: JORDAN1I:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th20: :: JORDAN1I:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th21: :: JORDAN1I:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th22: :: JORDAN1I:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th23: :: JORDAN1I:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th25: :: JORDAN1I:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th26: :: JORDAN1I:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JORDAN1I:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
for
i,
k being
Nat for
C being non
empty compact non
horizontal non
vertical being_simple_closed_curve Subset of
(TOP-REAL 2) for
p being
Point of
(TOP-REAL 2) st
p `1 = ((W-bound C) + (E-bound C)) / 2 &
i > 0 & 1
<= k &
k <= width (Gauge C,i) &
(Gauge C,i) * (Center (Gauge C,i)),
k in Upper_Arc (L~ (Cage C,i)) &
p `2 = sup (proj2 .: ((LSeg ((Gauge C,1) * (Center (Gauge C,1)),1),((Gauge C,i) * (Center (Gauge C,i)),k)) /\ (Lower_Arc (L~ (Cage C,i))))) holds
ex
j being
Nat st
( 1
<= j &
j <= width (Gauge C,i) &
p = (Gauge C,i) * (Center (Gauge C,i)),
j )