:: JORDAN6 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem :: JORDAN6:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th2: :: JORDAN6:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: JORDAN6:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: JORDAN6:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: JORDAN6:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: JORDAN6:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: JORDAN6:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: JORDAN6:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: JORDAN6:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: JORDAN6:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: JORDAN6:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: JORDAN6:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: JORDAN6:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: JORDAN6:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: JORDAN6:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let P be
Subset of
(TOP-REAL 2);
let p1,
p2 be
Point of
(TOP-REAL 2);
func x_Middle P,
p1,
p2 -> Point of
(TOP-REAL 2) means :
Def1:
:: JORDAN6:def 1
for
Q being
Subset of
(TOP-REAL 2) st
Q = { q where q is Point of (TOP-REAL 2) : q `1 = ((p1 `1 ) + (p2 `1 )) / 2 } holds
it = First_Point P,
p1,
p2,
Q;
existence
ex b1 being Point of (TOP-REAL 2) st
for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `1 = ((p1 `1 ) + (p2 `1 )) / 2 } holds
b1 = First_Point P,p1,p2,Q
uniqueness
for b1, b2 being Point of (TOP-REAL 2) st ( for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `1 = ((p1 `1 ) + (p2 `1 )) / 2 } holds
b1 = First_Point P,p1,p2,Q ) & ( for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `1 = ((p1 `1 ) + (p2 `1 )) / 2 } holds
b2 = First_Point P,p1,p2,Q ) holds
b1 = b2
end;
:: deftheorem Def1 defines x_Middle JORDAN6:def 1 :
definition
let P be
Subset of
(TOP-REAL 2);
let p1,
p2 be
Point of
(TOP-REAL 2);
func y_Middle P,
p1,
p2 -> Point of
(TOP-REAL 2) means :
Def2:
:: JORDAN6:def 2
for
Q being
Subset of
(TOP-REAL 2) st
Q = { q where q is Point of (TOP-REAL 2) : q `2 = ((p1 `2 ) + (p2 `2 )) / 2 } holds
it = First_Point P,
p1,
p2,
Q;
existence
ex b1 being Point of (TOP-REAL 2) st
for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `2 = ((p1 `2 ) + (p2 `2 )) / 2 } holds
b1 = First_Point P,p1,p2,Q
uniqueness
for b1, b2 being Point of (TOP-REAL 2) st ( for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `2 = ((p1 `2 ) + (p2 `2 )) / 2 } holds
b1 = First_Point P,p1,p2,Q ) & ( for Q being Subset of (TOP-REAL 2) st Q = { q where q is Point of (TOP-REAL 2) : q `2 = ((p1 `2 ) + (p2 `2 )) / 2 } holds
b2 = First_Point P,p1,p2,Q ) holds
b1 = b2
end;
:: deftheorem Def2 defines y_Middle JORDAN6:def 2 :
theorem :: JORDAN6:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: JORDAN6:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) for
p1,
p2,
q1,
q2 being
Point of
(TOP-REAL 2) st
P is_an_arc_of p1,
p2 &
LE q1,
q2,
P,
p1,
p2 holds
LE q2,
q1,
P,
p2,
p1
definition
let P be
Subset of
(TOP-REAL 2);
let p1,
p2,
q1 be
Point of
(TOP-REAL 2);
func L_Segment P,
p1,
p2,
q1 -> Subset of
(TOP-REAL 2) equals :: JORDAN6:def 3
{ q where q is Point of (TOP-REAL 2) : LE q,q1,P,p1,p2 } ;
coherence
{ q where q is Point of (TOP-REAL 2) : LE q,q1,P,p1,p2 } is Subset of (TOP-REAL 2)
end;
:: deftheorem defines L_Segment JORDAN6:def 3 :
definition
let P be
Subset of
(TOP-REAL 2);
let p1,
p2,
q1 be
Point of
(TOP-REAL 2);
func R_Segment P,
p1,
p2,
q1 -> Subset of
(TOP-REAL 2) equals :: JORDAN6:def 4
{ q where q is Point of (TOP-REAL 2) : LE q1,q,P,p1,p2 } ;
coherence
{ q where q is Point of (TOP-REAL 2) : LE q1,q,P,p1,p2 } is Subset of (TOP-REAL 2)
end;
:: deftheorem defines R_Segment JORDAN6:def 4 :
theorem Th20: :: JORDAN6:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: JORDAN6:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let P be
Subset of
(TOP-REAL 2);
let p1,
p2,
q1,
q2 be
Point of
(TOP-REAL 2);
func Segment P,
p1,
p2,
q1,
q2 -> Subset of
(TOP-REAL 2) equals :: JORDAN6:def 5
(R_Segment P,p1,p2,q1) /\ (L_Segment P,p1,p2,q2);
correctness
coherence
(R_Segment P,p1,p2,q1) /\ (L_Segment P,p1,p2,q2) is Subset of (TOP-REAL 2);
;
end;
:: deftheorem defines Segment JORDAN6:def 5 :
for
P being
Subset of
(TOP-REAL 2) for
p1,
p2,
q1,
q2 being
Point of
(TOP-REAL 2) holds
Segment P,
p1,
p2,
q1,
q2 = (R_Segment P,p1,p2,q1) /\ (L_Segment P,p1,p2,q2);
theorem :: JORDAN6:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) for
p1,
p2,
q1,
q2 being
Point of
(TOP-REAL 2) holds
Segment P,
p1,
p2,
q1,
q2 = { q where q is Point of (TOP-REAL 2) : ( LE q1,q,P,p1,p2 & LE q,q2,P,p1,p2 ) }
theorem Th30: :: JORDAN6:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) for
p1,
p2,
q1,
q2 being
Point of
(TOP-REAL 2) st
P is_an_arc_of p1,
p2 holds
(
LE q1,
q2,
P,
p1,
p2 iff
LE q2,
q1,
P,
p2,
p1 )
theorem Th31: :: JORDAN6:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) for
p1,
p2,
q1,
q2 being
Point of
(TOP-REAL 2) st
P is_an_arc_of p1,
p2 &
q1 in P &
q2 in P holds
Segment P,
p1,
p2,
q1,
q2 = Segment P,
p2,
p1,
q2,
q1
:: deftheorem defines Vertical_Line JORDAN6:def 6 :
:: deftheorem defines Horizontal_Line JORDAN6:def 7 :
theorem Th33: :: JORDAN6:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: JORDAN6:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th40: :: JORDAN6:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) st
P is_simple_closed_curve holds
ex
P1,
P2 being non
empty Subset of
(TOP-REAL 2) st
(
P1 is_an_arc_of W-min P,
E-max P &
P2 is_an_arc_of E-max P,
W-min P &
P1 /\ P2 = {(W-min P),(E-max P)} &
P1 \/ P2 = P &
(First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 )
theorem Th41: :: JORDAN6:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm1:
for r, s being real number holds ].r,s.[ misses {r,s}
by RCOMP_1:46;
Lm2:
for a, b, c being real number holds
( c in ].a,b.[ iff ( a < c & c < b ) )
by RCOMP_1:47;
theorem :: JORDAN6:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: JORDAN6:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: JORDAN6:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: JORDAN6:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th52: :: JORDAN6:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th53: :: JORDAN6:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th54: :: JORDAN6:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th55: :: JORDAN6:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: JORDAN6:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th59: :: JORDAN6:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th60: :: JORDAN6:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th61: :: JORDAN6:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm3:
for g being Function of I[01] ,R^1
for s1, s2, r being real number st g is continuous & g . 0[01] < r & r < g . 1[01] & s1 = g . 0 & s2 = g . 1 holds
ex r1 being Real st
( 0 < r1 & r1 < 1 & g . r1 = r )
theorem :: JORDAN6:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JORDAN6:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th64: :: JORDAN6:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm4:
now
let P be
Simple_closed_curve;
:: thesis: for P1, P1' being non empty Subset of (TOP-REAL 2) st ex P2 being non empty Subset of (TOP-REAL 2) st
( P1 is_an_arc_of W-min P, E-max P & P2 is_an_arc_of E-max P, W-min P & P1 /\ P2 = {(W-min P),(E-max P)} & P1 \/ P2 = P & (First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) & ex P2' being non empty Subset of (TOP-REAL 2) st
( P1' is_an_arc_of W-min P, E-max P & P2' is_an_arc_of E-max P, W-min P & P1' /\ P2' = {(W-min P),(E-max P)} & P1' \/ P2' = P & (First_Point P1',(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2',(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) holds
P1 = P1'let P1,
P1' be non
empty Subset of
(TOP-REAL 2);
:: thesis: ( ex P2 being non empty Subset of (TOP-REAL 2) st
( P1 is_an_arc_of W-min P, E-max P & P2 is_an_arc_of E-max P, W-min P & P1 /\ P2 = {(W-min P),(E-max P)} & P1 \/ P2 = P & (First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) & ex P2' being non empty Subset of (TOP-REAL 2) st
( P1' is_an_arc_of W-min P, E-max P & P2' is_an_arc_of E-max P, W-min P & P1' /\ P2' = {(W-min P),(E-max P)} & P1' \/ P2' = P & (First_Point P1',(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2',(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) implies P1 = P1' )assume A1:
( ex
P2 being non
empty Subset of
(TOP-REAL 2) st
(
P1 is_an_arc_of W-min P,
E-max P &
P2 is_an_arc_of E-max P,
W-min P &
P1 /\ P2 = {(W-min P),(E-max P)} &
P1 \/ P2 = P &
(First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) & ex
P2' being non
empty Subset of
(TOP-REAL 2) st
(
P1' is_an_arc_of W-min P,
E-max P &
P2' is_an_arc_of E-max P,
W-min P &
P1' /\ P2' = {(W-min P),(E-max P)} &
P1' \/ P2' = P &
(First_Point P1',(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2',(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) )
;
:: thesis: P1 = P1'then consider P2 being non
empty Subset of
(TOP-REAL 2) such that A2:
(
P1 is_an_arc_of W-min P,
E-max P &
P2 is_an_arc_of E-max P,
W-min P &
P1 /\ P2 = {(W-min P),(E-max P)} &
P1 \/ P2 = P &
(First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 )
;
A3:
P2 is_an_arc_of W-min P,
E-max P
by A2, JORDAN5B:14;
consider P2' being non
empty Subset of
(TOP-REAL 2) such that A4:
(
P1' is_an_arc_of W-min P,
E-max P &
P2' is_an_arc_of E-max P,
W-min P &
P1' /\ P2' = {(W-min P),(E-max P)} &
P1' \/ P2' = P &
(First_Point P1',(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2',(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 )
by A1;
A5:
P2' is_an_arc_of W-min P,
E-max P
by A4, JORDAN5B:14;
now
assume A6:
(
P1 = P2' &
P2 = P1' )
;
:: thesis: contradictionA7:
(W-min P) `1 = W-bound P
by PSCOMP_1:84;
A8:
(E-max P) `1 = E-bound P
by PSCOMP_1:104;
then
(W-min P) `1 < (E-max P) `1
by A7, TOPREAL5:23;
then A9:
(
(W-min P) `1 <= ((W-bound P) + (E-bound P)) / 2 &
((W-bound P) + (E-bound P)) / 2
<= (E-max P) `1 )
by A7, A8, TOPREAL3:3;
then
(
P2 meets Vertical_Line (((W-bound P) + (E-bound P)) / 2) &
P2 /\ (Vertical_Line (((W-bound P) + (E-bound P)) / 2)) is
closed )
by A3, Th64;
then A10:
(First_Point P1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (First_Point P2,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2
by A2, JORDAN5C:18;
(
P2' meets Vertical_Line (((W-bound P) + (E-bound P)) / 2) &
P2' /\ (Vertical_Line (((W-bound P) + (E-bound P)) / 2)) is
closed )
by A5, A9, Th64;
hence
contradiction
by A4, A6, A10, JORDAN5C:18;
:: thesis: verum
end;
hence
P1 = P1'
by A2, A3, A4, A5, Th61;
:: thesis: verum
end;
definition
let P be
Subset of
(TOP-REAL 2);
assume A1:
P is_simple_closed_curve
;
func Upper_Arc P -> non
empty Subset of
(TOP-REAL 2) means :
Def8:
:: JORDAN6:def 8
(
it is_an_arc_of W-min P,
E-max P & ex
P2 being non
empty Subset of
(TOP-REAL 2) st
(
P2 is_an_arc_of E-max P,
W-min P &
it /\ P2 = {(W-min P),(E-max P)} &
it \/ P2 = P &
(First_Point it,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) );
existence
ex b1 being non empty Subset of (TOP-REAL 2) st
( b1 is_an_arc_of W-min P, E-max P & ex P2 being non empty Subset of (TOP-REAL 2) st
( P2 is_an_arc_of E-max P, W-min P & b1 /\ P2 = {(W-min P),(E-max P)} & b1 \/ P2 = P & (First_Point b1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) )
uniqueness
for b1, b2 being non empty Subset of (TOP-REAL 2) st b1 is_an_arc_of W-min P, E-max P & ex P2 being non empty Subset of (TOP-REAL 2) st
( P2 is_an_arc_of E-max P, W-min P & b1 /\ P2 = {(W-min P),(E-max P)} & b1 \/ P2 = P & (First_Point b1,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) & b2 is_an_arc_of W-min P, E-max P & ex P2 being non empty Subset of (TOP-REAL 2) st
( P2 is_an_arc_of E-max P, W-min P & b2 /\ P2 = {(W-min P),(E-max P)} & b2 \/ P2 = P & (First_Point b2,(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point P2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 ) holds
b1 = b2
by A1, Lm4;
end;
:: deftheorem Def8 defines Upper_Arc JORDAN6:def 8 :
definition
let P be
Subset of
(TOP-REAL 2);
assume A1:
P is_simple_closed_curve
;
then A2:
Upper_Arc P is_an_arc_of W-min P,
E-max P
by Def8;
func Lower_Arc P -> non
empty Subset of
(TOP-REAL 2) means :
Def9:
:: JORDAN6:def 9
(
it is_an_arc_of E-max P,
W-min P &
(Upper_Arc P) /\ it = {(W-min P),(E-max P)} &
(Upper_Arc P) \/ it = P &
(First_Point (Upper_Arc P),(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point it,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 );
existence
ex b1 being non empty Subset of (TOP-REAL 2) st
( b1 is_an_arc_of E-max P, W-min P & (Upper_Arc P) /\ b1 = {(W-min P),(E-max P)} & (Upper_Arc P) \/ b1 = P & (First_Point (Upper_Arc P),(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point b1,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 )
by A1, Def8;
uniqueness
for b1, b2 being non empty Subset of (TOP-REAL 2) st b1 is_an_arc_of E-max P, W-min P & (Upper_Arc P) /\ b1 = {(W-min P),(E-max P)} & (Upper_Arc P) \/ b1 = P & (First_Point (Upper_Arc P),(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point b1,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 & b2 is_an_arc_of E-max P, W-min P & (Upper_Arc P) /\ b2 = {(W-min P),(E-max P)} & (Upper_Arc P) \/ b2 = P & (First_Point (Upper_Arc P),(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point b2,(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 holds
b1 = b2
end;
:: deftheorem Def9 defines Lower_Arc JORDAN6:def 9 :
theorem Th65: :: JORDAN6:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
P being
Subset of
(TOP-REAL 2) st
P is_simple_closed_curve holds
(
Upper_Arc P is_an_arc_of W-min P,
E-max P &
Upper_Arc P is_an_arc_of E-max P,
W-min P &
Lower_Arc P is_an_arc_of E-max P,
W-min P &
Lower_Arc P is_an_arc_of W-min P,
E-max P &
(Upper_Arc P) /\ (Lower_Arc P) = {(W-min P),(E-max P)} &
(Upper_Arc P) \/ (Lower_Arc P) = P &
(First_Point (Upper_Arc P),(W-min P),(E-max P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 > (Last_Point (Lower_Arc P),(E-max P),(W-min P),(Vertical_Line (((W-bound P) + (E-bound P)) / 2))) `2 )
theorem Th66: :: JORDAN6:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th69: :: JORDAN6:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th70: :: JORDAN6:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let P be
Subset of
(TOP-REAL 2);
let q1,
q2 be
Point of
(TOP-REAL 2);
pred LE q1,
q2,
P means :
Def10:
:: JORDAN6:def 10
( (
q1 in Upper_Arc P &
q2 in Lower_Arc P & not
q2 = W-min P ) or (
q1 in Upper_Arc P &
q2 in Upper_Arc P &
LE q1,
q2,
Upper_Arc P,
W-min P,
E-max P ) or (
q1 in Lower_Arc P &
q2 in Lower_Arc P & not
q2 = W-min P &
LE q1,
q2,
Lower_Arc P,
E-max P,
W-min P ) );
end;
:: deftheorem Def10 defines LE JORDAN6:def 10 :
for
P being
Subset of
(TOP-REAL 2) for
q1,
q2 being
Point of
(TOP-REAL 2) holds
(
LE q1,
q2,
P iff ( (
q1 in Upper_Arc P &
q2 in Lower_Arc P & not
q2 = W-min P ) or (
q1 in Upper_Arc P &
q2 in Upper_Arc P &
LE q1,
q2,
Upper_Arc P,
W-min P,
E-max P ) or (
q1 in Lower_Arc P &
q2 in Lower_Arc P & not
q2 = W-min P &
LE q1,
q2,
Lower_Arc P,
E-max P,
W-min P ) ) );
theorem :: JORDAN6:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN6:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)