:: JORDAN1F semantic presentation
theorem Th1: :: JORDAN1F:1
for
b1,
b2,
b3 being
Nat for
b4 being
FinSequence of the
carrier of
(TOP-REAL 2) for
b5 being
Go-board st
b4 is_sequence_on b5 &
LSeg (b5 * b1,b2),
(b5 * b1,b3) meets L~ b4 &
[b1,b2] in Indices b5 &
[b1,b3] in Indices b5 &
b2 <= b3 holds
ex
b6 being
Nat st
(
b2 <= b6 &
b6 <= b3 &
(b5 * b1,b6) `2 = inf (proj2 .: ((LSeg (b5 * b1,b2),(b5 * b1,b3)) /\ (L~ b4))) )
theorem Th2: :: JORDAN1F:2
for
b1,
b2,
b3 being
Nat for
b4 being
FinSequence of the
carrier of
(TOP-REAL 2) for
b5 being
Go-board st
b4 is_sequence_on b5 &
LSeg (b5 * b1,b2),
(b5 * b1,b3) meets L~ b4 &
[b1,b2] in Indices b5 &
[b1,b3] in Indices b5 &
b2 <= b3 holds
ex
b6 being
Nat st
(
b2 <= b6 &
b6 <= b3 &
(b5 * b1,b6) `2 = sup (proj2 .: ((LSeg (b5 * b1,b2),(b5 * b1,b3)) /\ (L~ b4))) )
theorem Th3: :: JORDAN1F:3
for
b1,
b2,
b3 being
Nat for
b4 being
FinSequence of the
carrier of
(TOP-REAL 2) for
b5 being
Go-board st
b4 is_sequence_on b5 &
LSeg (b5 * b1,b2),
(b5 * b3,b2) meets L~ b4 &
[b1,b2] in Indices b5 &
[b3,b2] in Indices b5 &
b1 <= b3 holds
ex
b6 being
Nat st
(
b1 <= b6 &
b6 <= b3 &
(b5 * b6,b2) `1 = inf (proj1 .: ((LSeg (b5 * b1,b2),(b5 * b3,b2)) /\ (L~ b4))) )
theorem Th4: :: JORDAN1F:4
for
b1,
b2,
b3 being
Nat for
b4 being
FinSequence of the
carrier of
(TOP-REAL 2) for
b5 being
Go-board st
b4 is_sequence_on b5 &
LSeg (b5 * b1,b2),
(b5 * b3,b2) meets L~ b4 &
[b1,b2] in Indices b5 &
[b3,b2] in Indices b5 &
b1 <= b3 holds
ex
b6 being
Nat st
(
b1 <= b6 &
b6 <= b3 &
(b5 * b6,b2) `1 = sup (proj1 .: ((LSeg (b5 * b1,b2),(b5 * b3,b2)) /\ (L~ b4))) )
theorem Th5: :: JORDAN1F:5
theorem Th6: :: JORDAN1F:6
theorem Th7: :: JORDAN1F:7
theorem Th8: :: JORDAN1F:8
theorem Th9: :: JORDAN1F:9
theorem Th10: :: JORDAN1F:10
theorem Th11: :: JORDAN1F:11
for
b1 being
Go-board for
b2 being
Point of
(TOP-REAL 2) for
b3 being
FinSequence of
(TOP-REAL 2) st
b3 is_sequence_on b1 & ex
b4,
b5 being
Nat st
(
[b4,b5] in Indices b1 &
b2 = b1 * b4,
b5 ) & ( for
b4,
b5,
b6,
b7 being
Nat st
[b4,b5] in Indices b1 &
[b6,b7] in Indices b1 &
b2 = b1 * b4,
b5 &
b3 /. 1
= b1 * b6,
b7 holds
(abs (b6 - b4)) + (abs (b7 - b5)) = 1 ) holds
<*b2*> ^ b3 is_sequence_on b1
theorem Th12: :: JORDAN1F:12
theorem Th13: :: JORDAN1F:13
for
b1 being
Nat for
b2 being non
empty being_simple_closed_curve compact non
horizontal non
vertical Subset of
(TOP-REAL 2) for
b3 being
Point of
(TOP-REAL 2) st
b3 `1 = ((W-bound b2) + (E-bound b2)) / 2 &
b3 `2 = inf (proj2 .: ((LSeg ((Gauge b2,1) * (Center (Gauge b2,1)),1),((Gauge b2,1) * (Center (Gauge b2,1)),(width (Gauge b2,1)))) /\ (Upper_Arc (L~ (Cage b2,(b1 + 1)))))) holds
ex
b4 being
Nat st
( 1
<= b4 &
b4 <= width (Gauge b2,(b1 + 1)) &
b3 = (Gauge b2,(b1 + 1)) * (Center (Gauge b2,(b1 + 1))),
b4 )