:: JGRAPH_2 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
TOP-REAL 2 = TopSpaceMetr (Euclid 2)
by EUCLID:def 8;
theorem :: JGRAPH_2:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th2: :: JGRAPH_2:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: JGRAPH_2:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: JGRAPH_2:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: JGRAPH_2:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: JGRAPH_2:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: JGRAPH_2:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: JGRAPH_2:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: JGRAPH_2:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: JGRAPH_2:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: JGRAPH_2:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: JGRAPH_2:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: JGRAPH_2:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: JGRAPH_2:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th18: :: JGRAPH_2:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: JGRAPH_2:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th20: :: JGRAPH_2:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: JGRAPH_2:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th22: :: JGRAPH_2:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
func Out_In_Sq -> Function of the
carrier of
(TOP-REAL 2) \ {(0.REAL 2)},the
carrier of
(TOP-REAL 2) \ {(0.REAL 2)} means :
Def1:
:: JGRAPH_2:def 1
for
p being
Point of
(TOP-REAL 2) st
p <> 0.REAL 2 holds
( ( ( (
p `2 <= p `1 &
- (p `1 ) <= p `2 ) or (
p `2 >= p `1 &
p `2 <= - (p `1 ) ) ) implies
it . p = |[(1 / (p `1 )),(((p `2 ) / (p `1 )) / (p `1 ))]| ) & ( (
p `2 <= p `1 &
- (p `1 ) <= p `2 ) or (
p `2 >= p `1 &
p `2 <= - (p `1 ) ) or
it . p = |[(((p `1 ) / (p `2 )) / (p `2 )),(1 / (p `2 ))]| ) );
existence
ex b1 being Function of the carrier of (TOP-REAL 2) \ {(0.REAL 2)},the carrier of (TOP-REAL 2) \ {(0.REAL 2)} st
for p being Point of (TOP-REAL 2) st p <> 0.REAL 2 holds
( ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) implies b1 . p = |[(1 / (p `1 )),(((p `2 ) / (p `1 )) / (p `1 ))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or b1 . p = |[(((p `1 ) / (p `2 )) / (p `2 )),(1 / (p `2 ))]| ) )
uniqueness
for b1, b2 being Function of the carrier of (TOP-REAL 2) \ {(0.REAL 2)},the carrier of (TOP-REAL 2) \ {(0.REAL 2)} st ( for p being Point of (TOP-REAL 2) st p <> 0.REAL 2 holds
( ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) implies b1 . p = |[(1 / (p `1 )),(((p `2 ) / (p `1 )) / (p `1 ))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or b1 . p = |[(((p `1 ) / (p `2 )) / (p `2 )),(1 / (p `2 ))]| ) ) ) & ( for p being Point of (TOP-REAL 2) st p <> 0.REAL 2 holds
( ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) implies b2 . p = |[(1 / (p `1 )),(((p `2 ) / (p `1 )) / (p `1 ))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or b2 . p = |[(((p `1 ) / (p `2 )) / (p `2 )),(1 / (p `2 ))]| ) ) ) holds
b1 = b2
end;
:: deftheorem Def1 defines Out_In_Sq JGRAPH_2:def 1 :
theorem Th23: :: JGRAPH_2:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: JGRAPH_2:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: JGRAPH_2:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th26: :: JGRAPH_2:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: JGRAPH_2:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: JGRAPH_2:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: JGRAPH_2:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: JGRAPH_2:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: JGRAPH_2:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: JGRAPH_2:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: JGRAPH_2:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: JGRAPH_2:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: JGRAPH_2:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: JGRAPH_2:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th38: :: JGRAPH_2:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th39: :: JGRAPH_2:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th40: :: JGRAPH_2:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th41: :: JGRAPH_2:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th42: :: JGRAPH_2:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th43: :: JGRAPH_2:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th44: :: JGRAPH_2:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th45: :: JGRAPH_2:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
K0,
B0 being
Subset of
(TOP-REAL 2) for
f being
Function of
((TOP-REAL 2) | K0),
((TOP-REAL 2) | B0) for
f1,
f2 being
Function of
((TOP-REAL 2) | K0),
R^1 st
f1 is
continuous &
f2 is
continuous &
K0 <> {} &
B0 <> {} & ( for
x,
y,
r,
s being
real number st
|[x,y]| in K0 &
r = f1 . |[x,y]| &
s = f2 . |[x,y]| holds
f . |[x,y]| = |[r,s]| ) holds
f is
continuous
theorem Th46: :: JGRAPH_2:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: JGRAPH_2:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
deffunc H1( Point of (TOP-REAL 2)) -> Element of REAL = $1 `1 ;
deffunc H2( Point of (TOP-REAL 2)) -> Element of REAL = $1 `2 ;
Lm3:
for p, q being Point of (TOP-REAL 2) holds
( H1(p - q) = H1(p) - H1(q) & H2(p - q) = H2(p) - H2(q) )
by TOPREAL3:8;
Lm4:
for p, q being Point of (TOP-REAL 2) holds |.(p - q).| ^2 = (H1(p - q) ^2 ) + (H2(p - q) ^2 )
by JGRAPH_1:46;
Lm5:
{ p7 where p7 is Point of (TOP-REAL 2) : H1(p7) <= H2(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm3, Lm4);
Lm6:
for p, q being Point of (TOP-REAL 2) holds
( H2(p - q) = H2(p) - H2(q) & H1(p - q) = H1(p) - H1(q) )
by TOPREAL3:8;
Lm7:
for p, q being Point of (TOP-REAL 2) holds |.(p - q).| ^2 = (H2(p - q) ^2 ) + (H1(p - q) ^2 )
by JGRAPH_1:46;
Lm8:
{ p7 where p7 is Point of (TOP-REAL 2) : H2(p7) <= H1(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm6, Lm7);
deffunc H3( Point of (TOP-REAL 2)) -> Element of REAL = - ($1 `1 );
deffunc H4( Point of (TOP-REAL 2)) -> Element of REAL = - ($1 `2 );
Lm11:
{ p7 where p7 is Point of (TOP-REAL 2) : H3(p7) <= H2(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm9, Lm10);
Lm14:
{ p7 where p7 is Point of (TOP-REAL 2) : H2(p7) <= H3(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm12, Lm13);
Lm17:
{ p7 where p7 is Point of (TOP-REAL 2) : H4(p7) <= H1(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm15, Lm16);
Lm20:
{ p7 where p7 is Point of (TOP-REAL 2) : H1(p7) <= H4(p7) } is closed Subset of (TOP-REAL 2)
from JGRAPH_2:sch 3(, Lm18, Lm19);
theorem Th48: :: JGRAPH_2:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: JGRAPH_2:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th50: :: JGRAPH_2:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th51: :: JGRAPH_2:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th52: :: JGRAPH_2:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th53: :: JGRAPH_2:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let A,
B,
C,
D be
real number ;
func AffineMap A,
B,
C,
D -> Function of
(TOP-REAL 2),
(TOP-REAL 2) means :
Def2:
:: JGRAPH_2:def 2
for
t being
Point of
(TOP-REAL 2) holds
it . t = |[((A * (t `1 )) + B),((C * (t `2 )) + D)]|;
existence
ex b1 being Function of (TOP-REAL 2),(TOP-REAL 2) st
for t being Point of (TOP-REAL 2) holds b1 . t = |[((A * (t `1 )) + B),((C * (t `2 )) + D)]|
uniqueness
for b1, b2 being Function of (TOP-REAL 2),(TOP-REAL 2) st ( for t being Point of (TOP-REAL 2) holds b1 . t = |[((A * (t `1 )) + B),((C * (t `2 )) + D)]| ) & ( for t being Point of (TOP-REAL 2) holds b2 . t = |[((A * (t `1 )) + B),((C * (t `2 )) + D)]| ) holds
b1 = b2
end;
:: deftheorem Def2 defines AffineMap JGRAPH_2:def 2 :
theorem Th54: :: JGRAPH_2:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JGRAPH_2:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)