:: JORDAN17 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: JORDAN17:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: JORDAN17:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
a,
b,
c,
d being
Point of
(TOP-REAL 2) for
P being
Subset of
(TOP-REAL 2) st
a <> b &
P is_an_arc_of c,
d &
LE a,
b,
P,
c,
d holds
ex
e being
Point of
(TOP-REAL 2) st
(
a <> e &
b <> e &
LE a,
e,
P,
c,
d &
LE e,
b,
P,
c,
d )
theorem Th7: :: JORDAN17:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: JORDAN17:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let P be
Subset of
(TOP-REAL 2);
let a,
b,
c,
d be
Point of
(TOP-REAL 2);
pred a,
b,
c,
d are_in_this_order_on P means :
Def1:
:: JORDAN17:def 1
( (
LE a,
b,
P &
LE b,
c,
P &
LE c,
d,
P ) or (
LE b,
c,
P &
LE c,
d,
P &
LE d,
a,
P ) or (
LE c,
d,
P &
LE d,
a,
P &
LE a,
b,
P ) or (
LE d,
a,
P &
LE a,
b,
P &
LE b,
c,
P ) );
end;
:: deftheorem Def1 defines are_in_this_order_on JORDAN17:def 1 :
for
P being
Subset of
(TOP-REAL 2) for
a,
b,
c,
d being
Point of
(TOP-REAL 2) holds
(
a,
b,
c,
d are_in_this_order_on P iff ( (
LE a,
b,
P &
LE b,
c,
P &
LE c,
d,
P ) or (
LE b,
c,
P &
LE c,
d,
P &
LE d,
a,
P ) or (
LE c,
d,
P &
LE d,
a,
P &
LE a,
b,
P ) or (
LE d,
a,
P &
LE a,
b,
P &
LE b,
c,
P ) ) );
theorem :: JORDAN17:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN17:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
C being
Simple_closed_curve for
a,
b,
c,
d being
Point of
(TOP-REAL 2) st
a in C &
b in C &
c in C &
d in C & not
a,
b,
c,
d are_in_this_order_on C & not
a,
b,
d,
c are_in_this_order_on C & not
a,
c,
b,
d are_in_this_order_on C & not
a,
c,
d,
b are_in_this_order_on C & not
a,
d,
b,
c are_in_this_order_on C holds
a,
d,
c,
b are_in_this_order_on C