:: JGRAPH_5 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for a, x being real number st a >= 0 & (x - a) * (x + a) >= 0 & not - a >= x holds
x >= a
by XREAL_1:97;
theorem :: JGRAPH_5:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th2: :: JGRAPH_5:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: JGRAPH_5:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: JGRAPH_5:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: JGRAPH_5:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: JGRAPH_5:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: JGRAPH_5:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: JGRAPH_5:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: JGRAPH_5:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
a,
b,
d,
e,
s1,
s2,
t1,
t2 being
Real for
h being
Function of
(Closed-Interval-TSpace a,b),
(Closed-Interval-TSpace d,e) st
h is_homeomorphism &
h . s1 = t1 &
h . s2 = t2 &
h . a = d &
h . b = e &
d <= e &
t1 <= t2 &
s1 in [.a,b.] &
s2 in [.a,b.] holds
s1 <= s2
theorem Th12: :: JGRAPH_5:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
a,
b,
d,
e,
s1,
s2,
t1,
t2 being
Real for
h being
Function of
(Closed-Interval-TSpace a,b),
(Closed-Interval-TSpace d,e) st
h is_homeomorphism &
h . s1 = t1 &
h . s2 = t2 &
h . a = e &
h . b = d &
e >= d &
t1 >= t2 &
s1 in [.a,b.] &
s2 in [.a,b.] holds
s1 <= s2
theorem :: JGRAPH_5:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: JGRAPH_5:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm2:
( 0 in [.0,1.] & 1 in [.0,1.] )
by RCOMP_1:15;
theorem Th15: :: JGRAPH_5:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: JGRAPH_5:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: JGRAPH_5:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: JGRAPH_5:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: JGRAPH_5:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
C0 being
Subset of
(TOP-REAL 2) st
C0 = { p where p is Point of (TOP-REAL 2) : |.p.| >= 1 } &
|.p1.| = 1 &
|.p2.| = 1 &
|.p3.| = 1 &
|.p4.| = 1 & ex
h being
Function of
(TOP-REAL 2),
(TOP-REAL 2) st
(
h is_homeomorphism &
h .: C0 c= C0 &
h . p1 = |[(- 1),0]| &
h . p2 = |[0,1]| &
h . p3 = |[1,0]| &
h . p4 = |[0,(- 1)]| ) holds
for
f,
g being
Function of
I[01] ,
(TOP-REAL 2) st
f is
continuous &
f is
one-to-one &
g is
continuous &
g is
one-to-one &
f . 0
= p1 &
f . 1
= p3 &
g . 0
= p4 &
g . 1
= p2 &
rng f c= C0 &
rng g c= C0 holds
rng f meets rng g
theorem Th21: :: JGRAPH_5:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: JGRAPH_5:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: JGRAPH_5:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: JGRAPH_5:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: JGRAPH_5:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: JGRAPH_5:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: JGRAPH_5:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: JGRAPH_5:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm3:
now
let P be non
empty compact Subset of
(TOP-REAL 2);
:: thesis: ( P = { q where q is Point of (TOP-REAL 2) : |.q.| = 1 } implies ( proj1 .: P = [.(- 1),1.] & proj2 .: P = [.(- 1),1.] ) )assume A1:
P = { q where q is Point of (TOP-REAL 2) : |.q.| = 1 }
;
:: thesis: ( proj1 .: P = [.(- 1),1.] & proj2 .: P = [.(- 1),1.] )A2:
proj1 .: P c= [.(- 1),1.]
[.(- 1),1.] c= proj1 .: P
proof
let y be
set ;
:: according to TARSKI:def 3 :: thesis: ( not y in [.(- 1),1.] or y in proj1 .: P )
assume
y in [.(- 1),1.]
;
:: thesis: y in proj1 .: P
then
y in { r where r is Real : ( - 1 <= r & r <= 1 ) }
by RCOMP_1:def 1;
then consider r being
Real such that A7:
(
y = r &
- 1
<= r &
r <= 1 )
;
set q =
|[r,(sqrt (1 - (r ^2 )))]|;
A8:
dom proj1 = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 1;
A9:
(
|[r,(sqrt (1 - (r ^2 )))]| `1 = r &
|[r,(sqrt (1 - (r ^2 )))]| `2 = sqrt (1 - (r ^2 )) )
by EUCLID:56;
1
^2 >= r ^2
by A7, JGRAPH_2:7;
then A10:
1
- (r ^2 ) >= 0
by XREAL_1:50, SQUARE_1:59;
|.|[r,(sqrt (1 - (r ^2 )))]|.| =
sqrt ((r ^2 ) + ((sqrt (1 - (r ^2 ))) ^2 ))
by A9, JGRAPH_3:10
.=
sqrt ((r ^2 ) + (1 - (r ^2 )))
by A10, SQUARE_1:def 4
.=
1
by SQUARE_1:83
;
then A11:
|[r,(sqrt (1 - (r ^2 )))]| in P
by A1;
proj1 . |[r,(sqrt (1 - (r ^2 )))]| =
|[r,(sqrt (1 - (r ^2 )))]| `1
by PSCOMP_1:def 28
.=
r
by EUCLID:56
;
hence
y in proj1 .: P
by A7, A8, A11, FUNCT_1:def 12;
:: thesis: verum
end;
hence
proj1 .: P = [.(- 1),1.]
by A2, XBOOLE_0:def 10;
:: thesis: proj2 .: P = [.(- 1),1.]A12:
proj2 .: P c= [.(- 1),1.]
[.(- 1),1.] c= proj2 .: P
proof
let y be
set ;
:: according to TARSKI:def 3 :: thesis: ( not y in [.(- 1),1.] or y in proj2 .: P )
assume
y in [.(- 1),1.]
;
:: thesis: y in proj2 .: P
then
y in { r where r is Real : ( - 1 <= r & r <= 1 ) }
by RCOMP_1:def 1;
then consider r being
Real such that A17:
(
y = r &
- 1
<= r &
r <= 1 )
;
set q =
|[(sqrt (1 - (r ^2 ))),r]|;
A18:
dom proj2 = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 1;
A19:
(
|[(sqrt (1 - (r ^2 ))),r]| `2 = r &
|[(sqrt (1 - (r ^2 ))),r]| `1 = sqrt (1 - (r ^2 )) )
by EUCLID:56;
1
^2 >= r ^2
by A17, JGRAPH_2:7;
then A20:
1
- (r ^2 ) >= 0
by XREAL_1:50, SQUARE_1:59;
|.|[(sqrt (1 - (r ^2 ))),r]|.| =
sqrt (((sqrt (1 - (r ^2 ))) ^2 ) + (r ^2 ))
by A19, JGRAPH_3:10
.=
sqrt ((1 - (r ^2 )) + (r ^2 ))
by A20, SQUARE_1:def 4
.=
1
by SQUARE_1:83
;
then A21:
|[(sqrt (1 - (r ^2 ))),r]| in P
by A1;
proj2 . |[(sqrt (1 - (r ^2 ))),r]| =
|[(sqrt (1 - (r ^2 ))),r]| `2
by PSCOMP_1:def 29
.=
r
by EUCLID:56
;
hence
y in proj2 .: P
by A17, A18, A21, FUNCT_1:def 12;
:: thesis: verum
end;
hence
proj2 .: P = [.(- 1),1.]
by A12, XBOOLE_0:def 10;
:: thesis: verum
end;
Lm4:
for P being non empty compact Subset of (TOP-REAL 2) st P = { q where q is Point of (TOP-REAL 2) : |.q.| = 1 } holds
W-bound P = - 1
theorem Th31: :: JGRAPH_5:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: JGRAPH_5:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: JGRAPH_5:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: JGRAPH_5:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: JGRAPH_5:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: JGRAPH_5:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th38: :: JGRAPH_5:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th39: :: JGRAPH_5:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th40: :: JGRAPH_5:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th41: :: JGRAPH_5:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th42: :: JGRAPH_5:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm5:
now
let P be non
empty compact Subset of
(TOP-REAL 2);
:: thesis: ( P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } implies ( proj1 | (Lower_Arc P) is continuous Function of ((TOP-REAL 2) | (Lower_Arc P)),(Closed-Interval-TSpace (- 1),1) & proj1 | (Lower_Arc P) is one-to-one & rng (proj1 | (Lower_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) ) )assume A1:
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 }
;
:: thesis: ( proj1 | (Lower_Arc P) is continuous Function of ((TOP-REAL 2) | (Lower_Arc P)),(Closed-Interval-TSpace (- 1),1) & proj1 | (Lower_Arc P) is one-to-one & rng (proj1 | (Lower_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) )reconsider g =
proj1 as
Function of
(TOP-REAL 2),
R^1 by TOPMETR:24;
set K0 =
Lower_Arc P;
reconsider g2 =
g | (Lower_Arc P) as
Function of
((TOP-REAL 2) | (Lower_Arc P)),
R^1 by JGRAPH_3:12;
A2:
for
p being
Point of
((TOP-REAL 2) | (Lower_Arc P)) holds
g2 . p = proj1 . p
then A3:
g2 is
continuous
by JGRAPH_2:39;
A4:
dom g2 = the
carrier of
((TOP-REAL 2) | (Lower_Arc P))
by FUNCT_2:def 1;
then A5:
dom g2 = Lower_Arc P
by JORDAN1:1;
A6:
Lower_Arc P c= P
by A1, Th36;
A7:
rng g2 c= the
carrier of
(Closed-Interval-TSpace (- 1),1)
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in rng g2 or x in the carrier of (Closed-Interval-TSpace (- 1),1) )
assume
x in rng g2
;
:: thesis: x in the carrier of (Closed-Interval-TSpace (- 1),1)
then consider z being
set such that A8:
(
z in dom g2 &
x = g2 . z )
by FUNCT_1:def 5;
z in P
by A5, A6, A8;
then consider p being
Point of
(TOP-REAL 2) such that A9:
(
p = z &
|.p.| = 1 )
by A1;
A10:
x =
proj1 . p
by A2, A4, A8, A9
.=
p `1
by PSCOMP_1:def 28
;
1
= ((p `1 ) ^2 ) + ((p `2 ) ^2 )
by A9, JGRAPH_3:10, SQUARE_1:59;
then
1
- ((p `1 ) ^2 ) >= 0
by SQUARE_1:72;
then
- (1 - ((p `1 ) ^2 )) <= 0
by XREAL_1:60;
then
((p `1 ) ^2 ) - 1
<= 0
;
then
(
- 1
<= p `1 &
p `1 <= 1 )
by JGRAPH_3:5;
then
x in [.(- 1),1.]
by A10, RCOMP_1:48;
hence
x in the
carrier of
(Closed-Interval-TSpace (- 1),1)
by TOPMETR:25;
:: thesis: verum
end;
then reconsider g3 =
g2 as
Function of
((TOP-REAL 2) | (Lower_Arc P)),
(Closed-Interval-TSpace (- 1),1) by A4, FUNCT_2:4;
dom g3 = the
carrier of
((TOP-REAL 2) | (Lower_Arc P))
by FUNCT_2:def 1;
then
dom g3 = [#] ((TOP-REAL 2) | (Lower_Arc P))
by PRE_TOPC:12;
then A11:
dom g3 = Lower_Arc P
by PRE_TOPC:def 10;
A12:
rng g2 c= [#] (Closed-Interval-TSpace (- 1),1)
by A7, PRE_TOPC:12;
A13:
[#] (Closed-Interval-TSpace (- 1),1) c= rng g3
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in [#] (Closed-Interval-TSpace (- 1),1) or x in rng g3 )
assume
x in [#] (Closed-Interval-TSpace (- 1),1)
;
:: thesis: x in rng g3
then
x in the
carrier of
(Closed-Interval-TSpace (- 1),1)
;
then A14:
x in [.(- 1),1.]
by TOPMETR:25;
then reconsider r =
x as
Real ;
set q =
|[r,(- (sqrt (1 - (r ^2 ))))]|;
A15:
|.|[r,(- (sqrt (1 - (r ^2 ))))]|.| =
sqrt (((|[r,(- (sqrt (1 - (r ^2 ))))]| `1 ) ^2 ) + ((|[r,(- (sqrt (1 - (r ^2 ))))]| `2 ) ^2 ))
by JGRAPH_3:10
.=
sqrt ((r ^2 ) + ((|[r,(- (sqrt (1 - (r ^2 ))))]| `2 ) ^2 ))
by EUCLID:56
.=
sqrt ((r ^2 ) + ((- (sqrt (1 - (r ^2 )))) ^2 ))
by EUCLID:56
.=
sqrt ((r ^2 ) + ((sqrt (1 - (r ^2 ))) ^2 ))
by SQUARE_1:61
;
(
- 1
<= r &
r <= 1 )
by A14, RCOMP_1:48;
then
1
^2 >= r ^2
by JGRAPH_2:7;
then A16:
1
- (r ^2 ) >= 0
by XREAL_1:50, SQUARE_1:59;
then
0
<= sqrt (1 - (r ^2 ))
by SQUARE_1:def 4;
then A17:
- (sqrt (1 - (r ^2 ))) <= 0
by XREAL_1:60;
|.|[r,(- (sqrt (1 - (r ^2 ))))]|.| =
sqrt ((r ^2 ) + (1 - (r ^2 )))
by A15, A16, SQUARE_1:def 4
.=
1
by SQUARE_1:83
;
then A18:
|[r,(- (sqrt (1 - (r ^2 ))))]| in P
by A1;
|[r,(- (sqrt (1 - (r ^2 ))))]| `2 = - (sqrt (1 - (r ^2 )))
by EUCLID:56;
then
|[r,(- (sqrt (1 - (r ^2 ))))]| in { p where p is Point of (TOP-REAL 2) : ( p in P & p `2 <= 0 ) }
by A17, A18;
then A19:
|[r,(- (sqrt (1 - (r ^2 ))))]| in dom g3
by A1, A11, Th38;
then g3 . |[r,(- (sqrt (1 - (r ^2 ))))]| =
proj1 . |[r,(- (sqrt (1 - (r ^2 ))))]|
by A2, A4
.=
|[r,(- (sqrt (1 - (r ^2 ))))]| `1
by PSCOMP_1:def 28
.=
r
by EUCLID:56
;
hence
x in rng g3
by A19, FUNCT_1:def 5;
:: thesis: verum
end;
reconsider B =
[.(- 1),1.] as non
empty Subset of
R^1 by TOPMETR:24, RCOMP_1:48;
A20:
Closed-Interval-TSpace (- 1),1
= R^1 | B
by TOPMETR:26;
for
x,
y being
set st
x in dom g3 &
y in dom g3 &
g3 . x = g3 . y holds
x = y
proof
let x,
y be
set ;
:: thesis: ( x in dom g3 & y in dom g3 & g3 . x = g3 . y implies x = y )
assume A21:
(
x in dom g3 &
y in dom g3 &
g3 . x = g3 . y )
;
:: thesis: x = y
then reconsider p1 =
x as
Point of
(TOP-REAL 2) by A11;
reconsider p2 =
y as
Point of
(TOP-REAL 2) by A11, A21;
A22:
g3 . x =
proj1 . p1
by A2, A4, A21
.=
p1 `1
by PSCOMP_1:def 28
;
A23:
g3 . y =
proj1 . p2
by A2, A4, A21
.=
p2 `1
by PSCOMP_1:def 28
;
A24:
p1 in P
by A6, A11, A21;
p2 in P
by A6, A11, A21;
then consider p22 being
Point of
(TOP-REAL 2) such that A25:
(
p2 = p22 &
|.p22.| = 1 )
by A1;
1
^2 = ((p2 `1 ) ^2 ) + ((p2 `2 ) ^2 )
by A25, JGRAPH_3:10;
then A26:
(1 ^2 ) - ((p2 `1 ) ^2 ) = (p2 `2 ) ^2
;
consider p11 being
Point of
(TOP-REAL 2) such that A27:
(
p1 = p11 &
|.p11.| = 1 )
by A1, A24;
1
^2 = ((p1 `1 ) ^2 ) + ((p1 `2 ) ^2 )
by A27, JGRAPH_3:10;
then
(1 ^2 ) - ((p1 `1 ) ^2 ) = (p1 `2 ) ^2
;
then
(- (p1 `2 )) ^2 = (p2 `2 ) ^2
by A21, A22, A23, A26, SQUARE_1:61;
then A28:
(- (p1 `2 )) ^2 = (- (p2 `2 )) ^2
by SQUARE_1:61;
p1 in { p3 where p3 is Point of (TOP-REAL 2) : ( p3 in P & p3 `2 <= 0 ) }
by A1, A11, A21, Th38;
then consider p33 being
Point of
(TOP-REAL 2) such that A29:
(
p1 = p33 &
p33 in P &
p33 `2 <= 0 )
;
- (- (p1 `2 )) <= 0
by A29;
then
- (p1 `2 ) >= 0
by XREAL_1:60;
then A30:
- (p1 `2 ) = sqrt ((- (p2 `2 )) ^2 )
by A28, SQUARE_1:89;
p2 in { p3 where p3 is Point of (TOP-REAL 2) : ( p3 in P & p3 `2 <= 0 ) }
by A1, A11, A21, Th38;
then consider p44 being
Point of
(TOP-REAL 2) such that A31:
(
p2 = p44 &
p44 in P &
p44 `2 <= 0 )
;
- (- (p2 `2 )) <= 0
by A31;
then
- (p2 `2 ) >= 0
by XREAL_1:60;
then
- (p1 `2 ) = - (p2 `2 )
by A30, SQUARE_1:89;
then
- (- (p1 `2 )) = p2 `2
;
then p1 =
|[(p2 `1 ),(p2 `2 )]|
by A21, A22, A23, EUCLID:57
.=
p2
by EUCLID:57
;
hence
x = y
;
:: thesis: verum
end;
hence
(
proj1 | (Lower_Arc P) is
continuous Function of
((TOP-REAL 2) | (Lower_Arc P)),
(Closed-Interval-TSpace (- 1),1) &
proj1 | (Lower_Arc P) is
one-to-one &
rng (proj1 | (Lower_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) )
by A3, A12, A13, A20, FUNCT_1:def 8, JGRAPH_1:63, XBOOLE_0:def 10;
:: thesis: verum
end;
Lm6:
now
let P be non
empty compact Subset of
(TOP-REAL 2);
:: thesis: ( P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } implies ( proj1 | (Upper_Arc P) is continuous Function of ((TOP-REAL 2) | (Upper_Arc P)),(Closed-Interval-TSpace (- 1),1) & proj1 | (Upper_Arc P) is one-to-one & rng (proj1 | (Upper_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) ) )assume A1:
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 }
;
:: thesis: ( proj1 | (Upper_Arc P) is continuous Function of ((TOP-REAL 2) | (Upper_Arc P)),(Closed-Interval-TSpace (- 1),1) & proj1 | (Upper_Arc P) is one-to-one & rng (proj1 | (Upper_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) )reconsider g =
proj1 as
Function of
(TOP-REAL 2),
R^1 by TOPMETR:24;
set K0 =
Upper_Arc P;
reconsider g2 =
g | (Upper_Arc P) as
Function of
((TOP-REAL 2) | (Upper_Arc P)),
R^1 by JGRAPH_3:12;
A2:
for
p being
Point of
((TOP-REAL 2) | (Upper_Arc P)) holds
g2 . p = proj1 . p
then A3:
g2 is
continuous
by JGRAPH_2:39;
A4:
dom g2 = the
carrier of
((TOP-REAL 2) | (Upper_Arc P))
by FUNCT_2:def 1;
then A5:
dom g2 = Upper_Arc P
by JORDAN1:1;
A6:
Upper_Arc P c= P
by A1, Th36;
A7:
rng g2 c= the
carrier of
(Closed-Interval-TSpace (- 1),1)
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in rng g2 or x in the carrier of (Closed-Interval-TSpace (- 1),1) )
assume
x in rng g2
;
:: thesis: x in the carrier of (Closed-Interval-TSpace (- 1),1)
then consider z being
set such that A8:
(
z in dom g2 &
x = g2 . z )
by FUNCT_1:def 5;
z in P
by A5, A6, A8;
then consider p being
Point of
(TOP-REAL 2) such that A9:
(
p = z &
|.p.| = 1 )
by A1;
A10:
x =
proj1 . p
by A2, A4, A8, A9
.=
p `1
by PSCOMP_1:def 28
;
1
= ((p `1 ) ^2 ) + ((p `2 ) ^2 )
by A9, JGRAPH_3:10, SQUARE_1:59;
then
1
- ((p `1 ) ^2 ) >= 0
by SQUARE_1:72;
then
- (1 - ((p `1 ) ^2 )) <= 0
by XREAL_1:60;
then
((p `1 ) ^2 ) - 1
<= 0
;
then
(
- 1
<= p `1 &
p `1 <= 1 )
by JGRAPH_3:5;
then
x in [.(- 1),1.]
by A10, RCOMP_1:48;
hence
x in the
carrier of
(Closed-Interval-TSpace (- 1),1)
by TOPMETR:25;
:: thesis: verum
end;
then reconsider g3 =
g2 as
Function of
((TOP-REAL 2) | (Upper_Arc P)),
(Closed-Interval-TSpace (- 1),1) by A4, FUNCT_2:4;
dom g3 = the
carrier of
((TOP-REAL 2) | (Upper_Arc P))
by FUNCT_2:def 1;
then
dom g3 = [#] ((TOP-REAL 2) | (Upper_Arc P))
by PRE_TOPC:12;
then A11:
dom g3 = Upper_Arc P
by PRE_TOPC:def 10;
A12:
rng g2 c= [#] (Closed-Interval-TSpace (- 1),1)
by A7, PRE_TOPC:12;
A13:
[#] (Closed-Interval-TSpace (- 1),1) c= rng g3
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in [#] (Closed-Interval-TSpace (- 1),1) or x in rng g3 )
assume
x in [#] (Closed-Interval-TSpace (- 1),1)
;
:: thesis: x in rng g3
then
x in the
carrier of
(Closed-Interval-TSpace (- 1),1)
;
then A14:
x in [.(- 1),1.]
by TOPMETR:25;
then reconsider r =
x as
Real ;
set q =
|[r,(sqrt (1 - (r ^2 )))]|;
A15:
|.|[r,(sqrt (1 - (r ^2 )))]|.| =
sqrt (((|[r,(sqrt (1 - (r ^2 )))]| `1 ) ^2 ) + ((|[r,(sqrt (1 - (r ^2 )))]| `2 ) ^2 ))
by JGRAPH_3:10
.=
sqrt ((r ^2 ) + ((|[r,(sqrt (1 - (r ^2 )))]| `2 ) ^2 ))
by EUCLID:56
.=
sqrt ((r ^2 ) + ((sqrt (1 - (r ^2 ))) ^2 ))
by EUCLID:56
;
(
- 1
<= r &
r <= 1 )
by A14, RCOMP_1:48;
then
1
^2 >= r ^2
by JGRAPH_2:7;
then A16:
1
- (r ^2 ) >= 0
by XREAL_1:50, SQUARE_1:59;
then A17:
0
<= sqrt (1 - (r ^2 ))
by SQUARE_1:def 4;
|.|[r,(sqrt (1 - (r ^2 )))]|.| =
sqrt ((r ^2 ) + (1 - (r ^2 )))
by A15, A16, SQUARE_1:def 4
.=
1
by SQUARE_1:83
;
then A18:
|[r,(sqrt (1 - (r ^2 )))]| in P
by A1;
|[r,(sqrt (1 - (r ^2 )))]| `2 = sqrt (1 - (r ^2 ))
by EUCLID:56;
then
|[r,(sqrt (1 - (r ^2 )))]| in { p where p is Point of (TOP-REAL 2) : ( p in P & p `2 >= 0 ) }
by A17, A18;
then A19:
|[r,(sqrt (1 - (r ^2 )))]| in dom g3
by A1, A11, Th37;
then g3 . |[r,(sqrt (1 - (r ^2 )))]| =
proj1 . |[r,(sqrt (1 - (r ^2 )))]|
by A2, A4
.=
|[r,(sqrt (1 - (r ^2 )))]| `1
by PSCOMP_1:def 28
.=
r
by EUCLID:56
;
hence
x in rng g3
by A19, FUNCT_1:def 5;
:: thesis: verum
end;
reconsider B =
[.(- 1),1.] as non
empty Subset of
R^1 by TOPMETR:24, RCOMP_1:48;
A20:
Closed-Interval-TSpace (- 1),1
= R^1 | B
by TOPMETR:26;
for
x,
y being
set st
x in dom g3 &
y in dom g3 &
g3 . x = g3 . y holds
x = y
proof
let x,
y be
set ;
:: thesis: ( x in dom g3 & y in dom g3 & g3 . x = g3 . y implies x = y )
assume A21:
(
x in dom g3 &
y in dom g3 &
g3 . x = g3 . y )
;
:: thesis: x = y
then reconsider p1 =
x as
Point of
(TOP-REAL 2) by A11;
reconsider p2 =
y as
Point of
(TOP-REAL 2) by A11, A21;
A22:
g3 . x =
proj1 . p1
by A2, A4, A21
.=
p1 `1
by PSCOMP_1:def 28
;
A23:
g3 . y =
proj1 . p2
by A2, A4, A21
.=
p2 `1
by PSCOMP_1:def 28
;
A24:
p1 in P
by A6, A11, A21;
p2 in P
by A6, A11, A21;
then consider p22 being
Point of
(TOP-REAL 2) such that A25:
(
p2 = p22 &
|.p22.| = 1 )
by A1;
1
^2 = ((p2 `1 ) ^2 ) + ((p2 `2 ) ^2 )
by A25, JGRAPH_3:10;
then A26:
(1 ^2 ) - ((p2 `1 ) ^2 ) = (p2 `2 ) ^2
;
consider p11 being
Point of
(TOP-REAL 2) such that A27:
(
p1 = p11 &
|.p11.| = 1 )
by A1, A24;
1
^2 = ((p1 `1 ) ^2 ) + ((p1 `2 ) ^2 )
by A27, JGRAPH_3:10;
then A28:
(p1 `2 ) ^2 = (p2 `2 ) ^2
by A21, A22, A23, A26, XCMPLX_1:26;
p1 in { p3 where p3 is Point of (TOP-REAL 2) : ( p3 in P & p3 `2 >= 0 ) }
by A1, A11, A21, Th37;
then consider p33 being
Point of
(TOP-REAL 2) such that A29:
(
p1 = p33 &
p33 in P &
p33 `2 >= 0 )
;
A30:
p1 `2 = sqrt ((p2 `2 ) ^2 )
by A28, A29, SQUARE_1:89;
p2 in { p3 where p3 is Point of (TOP-REAL 2) : ( p3 in P & p3 `2 >= 0 ) }
by A1, A11, A21, Th37;
then consider p44 being
Point of
(TOP-REAL 2) such that A31:
(
p2 = p44 &
p44 in P &
p44 `2 >= 0 )
;
p1 `2 = p2 `2
by A30, A31, SQUARE_1:89;
then p1 =
|[(p2 `1 ),(p2 `2 )]|
by A21, A22, A23, EUCLID:57
.=
p2
by EUCLID:57
;
hence
x = y
;
:: thesis: verum
end;
hence
(
proj1 | (Upper_Arc P) is
continuous Function of
((TOP-REAL 2) | (Upper_Arc P)),
(Closed-Interval-TSpace (- 1),1) &
proj1 | (Upper_Arc P) is
one-to-one &
rng (proj1 | (Upper_Arc P)) = [#] (Closed-Interval-TSpace (- 1),1) )
by A3, A12, A13, A20, FUNCT_1:def 8, JGRAPH_1:63, XBOOLE_0:def 10;
:: thesis: verum
end;
theorem Th43: :: JGRAPH_5:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th44: :: JGRAPH_5:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th45: :: JGRAPH_5:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th46: :: JGRAPH_5:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: JGRAPH_5:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: JGRAPH_5:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: JGRAPH_5:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th50: :: JGRAPH_5:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th51: :: JGRAPH_5:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th52: :: JGRAPH_5:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th53: :: JGRAPH_5:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th54: :: JGRAPH_5:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_5:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th56: :: JGRAPH_5:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th57: :: JGRAPH_5:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: JGRAPH_5:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th59: :: JGRAPH_5:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th60: :: JGRAPH_5:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th61: :: JGRAPH_5:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th62: :: JGRAPH_5:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P &
p1 `1 < 0 &
p1 `2 >= 0 &
p2 `1 < 0 &
p2 `2 >= 0 &
p3 `1 < 0 &
p3 `2 >= 0 &
p4 `1 < 0 &
p4 `2 >= 0 holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 < 0 &
q2 `1 < 0 &
q2 `2 < 0 &
q3 `1 < 0 &
q3 `2 < 0 &
q4 `1 < 0 &
q4 `2 < 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th63: :: JGRAPH_5:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P &
p1 `2 >= 0 &
p2 `2 >= 0 &
p3 `2 >= 0 &
p4 `2 > 0 holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 >= 0 &
q2 `1 < 0 &
q2 `2 >= 0 &
q3 `1 < 0 &
q3 `2 >= 0 &
q4 `1 < 0 &
q4 `2 >= 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th64: :: JGRAPH_5:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P &
p1 `2 >= 0 &
p2 `2 >= 0 &
p3 `2 >= 0 &
p4 `2 > 0 holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 < 0 &
q2 `1 < 0 &
q2 `2 < 0 &
q3 `1 < 0 &
q3 `2 < 0 &
q4 `1 < 0 &
q4 `2 < 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th65: :: JGRAPH_5:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P & (
p1 `2 >= 0 or
p1 `1 >= 0 ) & (
p2 `2 >= 0 or
p2 `1 >= 0 ) & (
p3 `2 >= 0 or
p3 `1 >= 0 ) & (
p4 `2 > 0 or
p4 `1 > 0 ) holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `2 >= 0 &
q2 `2 >= 0 &
q3 `2 >= 0 &
q4 `2 > 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th66: :: JGRAPH_5:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P & (
p1 `2 >= 0 or
p1 `1 >= 0 ) & (
p2 `2 >= 0 or
p2 `1 >= 0 ) & (
p3 `2 >= 0 or
p3 `1 >= 0 ) & (
p4 `2 > 0 or
p4 `1 > 0 ) holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 < 0 &
q2 `1 < 0 &
q2 `2 < 0 &
q3 `1 < 0 &
q3 `2 < 0 &
q4 `1 < 0 &
q4 `2 < 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem :: JGRAPH_5:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
p4 = W-min P &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 < 0 &
q2 `1 < 0 &
q2 `2 < 0 &
q3 `1 < 0 &
q3 `2 < 0 &
q4 `1 < 0 &
q4 `2 < 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th68: :: JGRAPH_5:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) ex
q1,
q2,
q3,
q4 being
Point of
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
q1 = f . p1 &
q2 = f . p2 &
q3 = f . p3 &
q4 = f . p4 &
q1 `1 < 0 &
q1 `2 < 0 &
q2 `1 < 0 &
q2 `2 < 0 &
q3 `1 < 0 &
q3 `2 < 0 &
q4 `1 < 0 &
q4 `2 < 0 &
LE q1,
q2,
P &
LE q2,
q3,
P &
LE q3,
q4,
P )
theorem Th69: :: JGRAPH_5:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P &
p1 <> p2 &
p2 <> p3 &
p3 <> p4 &
p1 `1 < 0 &
p2 `1 < 0 &
p3 `1 < 0 &
p4 `1 < 0 &
p1 `2 < 0 &
p2 `2 < 0 &
p3 `2 < 0 &
p4 `2 < 0 holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
|[(- 1),0]| = f . p1 &
|[0,1]| = f . p2 &
|[1,0]| = f . p3 &
|[0,(- 1)]| = f . p4 )
theorem Th70: :: JGRAPH_5:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P &
p1 <> p2 &
p2 <> p3 &
p3 <> p4 holds
ex
f being
Function of
(TOP-REAL 2),
(TOP-REAL 2) st
(
f is_homeomorphism & ( for
q being
Point of
(TOP-REAL 2) holds
|.(f . q).| = |.q.| ) &
|[(- 1),0]| = f . p1 &
|[0,1]| = f . p2 &
|[1,0]| = f . p3 &
|[0,(- 1)]| = f . p4 )
Lm7:
( |[(- 1),0]| `1 = - 1 & |[(- 1),0]| `2 = 0 & |[1,0]| `1 = 1 & |[1,0]| `2 = 0 & |[0,(- 1)]| `1 = 0 & |[0,(- 1)]| `2 = - 1 & |[0,1]| `1 = 0 & |[0,1]| `2 = 1 )
by EUCLID:56;
Lm8:
now
thus |.|[(- 1),0]|.| =
sqrt (((- 1) ^2 ) + (0 ^2 ))
by Lm7, JGRAPH_3:10
.=
1
by SQUARE_1:59, SQUARE_1:60, SQUARE_1:61, SQUARE_1:83
;
:: thesis: ( |.|[1,0]|.| = 1 & |.|[0,(- 1)]|.| = 1 & |.|[0,1]|.| = 1 )thus |.|[1,0]|.| =
sqrt (1 + 0)
by Lm7, JGRAPH_3:10, SQUARE_1:59, SQUARE_1:60
.=
1
by SQUARE_1:83
;
:: thesis: ( |.|[0,(- 1)]|.| = 1 & |.|[0,1]|.| = 1 )thus |.|[0,(- 1)]|.| =
sqrt ((0 ^2 ) + ((- 1) ^2 ))
by Lm7, JGRAPH_3:10
.=
1
by SQUARE_1:59, SQUARE_1:60, SQUARE_1:61, SQUARE_1:83
;
:: thesis: |.|[0,1]|.| = 1thus |.|[0,1]|.| =
sqrt ((0 ^2 ) + (1 ^2 ))
by Lm7, JGRAPH_3:10
.=
1
by SQUARE_1:59, SQUARE_1:60, SQUARE_1:83
;
:: thesis: verum
end;
Lm9:
0 in [.0,1.]
by RCOMP_1:48;
Lm10:
1 in [.0,1.]
by RCOMP_1:48;
theorem :: JGRAPH_5:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) for
C0 being
Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
for
f,
g being
Function of
I[01] ,
(TOP-REAL 2) st
f is
continuous &
f is
one-to-one &
g is
continuous &
g is
one-to-one &
C0 = { p where p is Point of (TOP-REAL 2) : |.p.| <= 1 } &
f . 0
= p1 &
f . 1
= p3 &
g . 0
= p2 &
g . 1
= p4 &
rng f c= C0 &
rng g c= C0 holds
rng f meets rng g
theorem :: JGRAPH_5:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) for
C0 being
Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
for
f,
g being
Function of
I[01] ,
(TOP-REAL 2) st
f is
continuous &
f is
one-to-one &
g is
continuous &
g is
one-to-one &
C0 = { p where p is Point of (TOP-REAL 2) : |.p.| <= 1 } &
f . 0
= p1 &
f . 1
= p3 &
g . 0
= p4 &
g . 1
= p2 &
rng f c= C0 &
rng g c= C0 holds
rng f meets rng g
theorem :: JGRAPH_5:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) for
C0 being
Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
for
f,
g being
Function of
I[01] ,
(TOP-REAL 2) st
f is
continuous &
f is
one-to-one &
g is
continuous &
g is
one-to-one &
C0 = { p where p is Point of (TOP-REAL 2) : |.p.| >= 1 } &
f . 0
= p1 &
f . 1
= p3 &
g . 0
= p4 &
g . 1
= p2 &
rng f c= C0 &
rng g c= C0 holds
rng f meets rng g
theorem :: JGRAPH_5:74 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
p1,
p2,
p3,
p4 being
Point of
(TOP-REAL 2) for
P being non
empty compact Subset of
(TOP-REAL 2) for
C0 being
Subset of
(TOP-REAL 2) st
P = { p where p is Point of (TOP-REAL 2) : |.p.| = 1 } &
LE p1,
p2,
P &
LE p2,
p3,
P &
LE p3,
p4,
P holds
for
f,
g being
Function of
I[01] ,
(TOP-REAL 2) st
f is
continuous &
f is
one-to-one &
g is
continuous &
g is
one-to-one &
C0 = { p where p is Point of (TOP-REAL 2) : |.p.| >= 1 } &
f . 0
= p1 &
f . 1
= p3 &
g . 0
= p2 &
g . 1
= p4 &
rng f c= C0 &
rng g c= C0 holds
rng f meets rng g