:: JORDAN11 semantic presentation
Lemma1:
for b1, b2, b3 being Nat
for b4 being being_simple_closed_curve Subset of (TOP-REAL 2) st b1 > 0 & 1 <= b2 & b2 <= width (Gauge b4,b1) & b3 <= b2 & 1 <= b3 & b3 <= width (Gauge b4,b1) & (LSeg ((Gauge b4,b1) * (Center (Gauge b4,b1)),b2),((Gauge b4,b1) * (Center (Gauge b4,b1)),b3)) /\ (Upper_Arc (L~ (Cage b4,b1))) = {((Gauge b4,b1) * (Center (Gauge b4,b1)),b2)} & (LSeg ((Gauge b4,b1) * (Center (Gauge b4,b1)),b2),((Gauge b4,b1) * (Center (Gauge b4,b1)),b3)) /\ (Lower_Arc (L~ (Cage b4,b1))) = {((Gauge b4,b1) * (Center (Gauge b4,b1)),b3)} holds
LSeg ((Gauge b4,b1) * (Center (Gauge b4,b1)),b2),((Gauge b4,b1) * (Center (Gauge b4,b1)),b3) c= Cl (RightComp (Cage b4,b1))
Lemma2:
for b1 being being_simple_closed_curve Subset of (TOP-REAL 2) ex b2 being Nat st b2 is_sufficiently_large_for b1
:: deftheorem Def1 defines ApproxIndex JORDAN11:def 1 :
theorem Th1: :: JORDAN11:1
definition
let c1 be
being_simple_closed_curve Subset of
(TOP-REAL 2);
func Y-InitStart c1 -> Nat means :
Def2:
:: JORDAN11:def 2
(
a2 < width (Gauge a1,(ApproxIndex a1)) &
cell (Gauge a1,(ApproxIndex a1)),
((X-SpanStart a1,(ApproxIndex a1)) -' 1),
a2 c= BDD a1 & ( for
b1 being
Nat st
b1 < width (Gauge a1,(ApproxIndex a1)) &
cell (Gauge a1,(ApproxIndex a1)),
((X-SpanStart a1,(ApproxIndex a1)) -' 1),
b1 c= BDD a1 holds
b1 >= a2 ) );
existence
ex b1 being Nat st
( b1 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b1 c= BDD c1 & ( for b2 being Nat st b2 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b2 c= BDD c1 holds
b2 >= b1 ) )
uniqueness
for b1, b2 being Nat st b1 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b1 c= BDD c1 & ( for b3 being Nat st b3 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b3 c= BDD c1 holds
b3 >= b1 ) & b2 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b2 c= BDD c1 & ( for b3 being Nat st b3 < width (Gauge c1,(ApproxIndex c1)) & cell (Gauge c1,(ApproxIndex c1)),((X-SpanStart c1,(ApproxIndex c1)) -' 1),b3 c= BDD c1 holds
b3 >= b2 ) holds
b1 = b2
end;
:: deftheorem Def2 defines Y-InitStart JORDAN11:def 2 :
for
b1 being
being_simple_closed_curve Subset of
(TOP-REAL 2) for
b2 being
Nat holds
(
b2 = Y-InitStart b1 iff (
b2 < width (Gauge b1,(ApproxIndex b1)) &
cell (Gauge b1,(ApproxIndex b1)),
((X-SpanStart b1,(ApproxIndex b1)) -' 1),
b2 c= BDD b1 & ( for
b3 being
Nat st
b3 < width (Gauge b1,(ApproxIndex b1)) &
cell (Gauge b1,(ApproxIndex b1)),
((X-SpanStart b1,(ApproxIndex b1)) -' 1),
b3 c= BDD b1 holds
b3 >= b2 ) ) );
theorem Th2: :: JORDAN11:2
theorem Th3: :: JORDAN11:3
definition
let c1 be
being_simple_closed_curve Subset of
(TOP-REAL 2);
let c2 be
Nat;
assume E8:
c2 is_sufficiently_large_for c1
;
E9:
c2 >= ApproxIndex c1
by E8, Def1;
set c3 =
X-SpanStart c1,
c2;
func Y-SpanStart c1,
c2 -> Nat means :
Def3:
:: JORDAN11:def 3
(
a3 <= width (Gauge a1,a2) & ( for
b1 being
Nat st
a3 <= b1 &
b1 <= ((2 |^ (a2 -' (ApproxIndex a1))) * ((Y-InitStart a1) -' 2)) + 2 holds
cell (Gauge a1,a2),
((X-SpanStart a1,a2) -' 1),
b1 c= BDD a1 ) & ( for
b1 being
Nat st
b1 <= width (Gauge a1,a2) & ( for
b2 being
Nat st
b1 <= b2 &
b2 <= ((2 |^ (a2 -' (ApproxIndex a1))) * ((Y-InitStart a1) -' 2)) + 2 holds
cell (Gauge a1,a2),
((X-SpanStart a1,a2) -' 1),
b2 c= BDD a1 ) holds
b1 >= a3 ) );
existence
ex b1 being Nat st
( b1 <= width (Gauge c1,c2) & ( for b2 being Nat st b1 <= b2 & b2 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b2 c= BDD c1 ) & ( for b2 being Nat st b2 <= width (Gauge c1,c2) & ( for b3 being Nat st b2 <= b3 & b3 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b3 c= BDD c1 ) holds
b2 >= b1 ) )
uniqueness
for b1, b2 being Nat st b1 <= width (Gauge c1,c2) & ( for b3 being Nat st b1 <= b3 & b3 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b3 c= BDD c1 ) & ( for b3 being Nat st b3 <= width (Gauge c1,c2) & ( for b4 being Nat st b3 <= b4 & b4 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b4 c= BDD c1 ) holds
b3 >= b1 ) & b2 <= width (Gauge c1,c2) & ( for b3 being Nat st b2 <= b3 & b3 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b3 c= BDD c1 ) & ( for b3 being Nat st b3 <= width (Gauge c1,c2) & ( for b4 being Nat st b3 <= b4 & b4 <= ((2 |^ (c2 -' (ApproxIndex c1))) * ((Y-InitStart c1) -' 2)) + 2 holds
cell (Gauge c1,c2),((X-SpanStart c1,c2) -' 1),b4 c= BDD c1 ) holds
b3 >= b2 ) holds
b1 = b2
end;
:: deftheorem Def3 defines Y-SpanStart JORDAN11:def 3 :
for
b1 being
being_simple_closed_curve Subset of
(TOP-REAL 2) for
b2 being
Nat st
b2 is_sufficiently_large_for b1 holds
for
b3 being
Nat holds
(
b3 = Y-SpanStart b1,
b2 iff (
b3 <= width (Gauge b1,b2) & ( for
b4 being
Nat st
b3 <= b4 &
b4 <= ((2 |^ (b2 -' (ApproxIndex b1))) * ((Y-InitStart b1) -' 2)) + 2 holds
cell (Gauge b1,b2),
((X-SpanStart b1,b2) -' 1),
b4 c= BDD b1 ) & ( for
b4 being
Nat st
b4 <= width (Gauge b1,b2) & ( for
b5 being
Nat st
b4 <= b5 &
b5 <= ((2 |^ (b2 -' (ApproxIndex b1))) * ((Y-InitStart b1) -' 2)) + 2 holds
cell (Gauge b1,b2),
((X-SpanStart b1,b2) -' 1),
b5 c= BDD b1 ) holds
b4 >= b3 ) ) );
theorem Th4: :: JORDAN11:4
theorem Th5: :: JORDAN11:5
theorem Th6: :: JORDAN11:6
theorem Th7: :: JORDAN11:7
theorem Th8: :: JORDAN11:8
theorem Th9: :: JORDAN11:9
theorem Th10: :: JORDAN11:10
theorem Th11: :: JORDAN11:11