:: JGRAPH_3 semantic presentation
:: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for x being real number holds (x ^2 ) + 1 > 0
Lm2:
TOP-REAL 2 = TopSpaceMetr (Euclid 2)
by EUCLID:def 8;
Lm3:
( dom proj1 = the carrier of (TOP-REAL 2) & dom proj2 = the carrier of (TOP-REAL 2) )
by FUNCT_2:def 1;
theorem Th1: :: JGRAPH_3:1
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th2: :: JGRAPH_3:2
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th3: :: JGRAPH_3:3
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm4:
for a, x being real number st a >= 0 & (x - a) * (x + a) <= 0 holds
( - a <= x & x <= a )
by XREAL_1:95;
theorem :: JGRAPH_3:4
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th5: :: JGRAPH_3:5
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th6: :: JGRAPH_3:6
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th7: :: JGRAPH_3:7
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th8: :: JGRAPH_3:8
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th9: :: JGRAPH_3:9
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JGRAPH_3:10
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JGRAPH_3:11
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th12: :: JGRAPH_3:12
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th13: :: JGRAPH_3:13
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
definition
func Sq_Circ -> Function of the
carrier of
(TOP-REAL 2),the
carrier of
(TOP-REAL 2) means :
Def1:
:: JGRAPH_3:def 1
for
p being
Point of
(TOP-REAL 2) holds
( (
p = 0.REAL 2 implies
it . p = p ) & ( ( (
p `2 <= p `1 &
- (p `1 ) <= p `2 ) or (
p `2 >= p `1 &
p `2 <= - (p `1 ) ) ) &
p <> 0.REAL 2 implies
it . p = |[((p `1 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 ))))]| ) & ( (
p `2 <= p `1 &
- (p `1 ) <= p `2 ) or (
p `2 >= p `1 &
p `2 <= - (p `1 ) ) or not
p <> 0.REAL 2 or
it . p = |[((p `1 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 ))))]| ) );
existence
ex b1 being Function of the carrier of (TOP-REAL 2),the carrier of (TOP-REAL 2) st
for p being Point of (TOP-REAL 2) holds
( ( p = 0.REAL 2 implies b1 . p = p ) & ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) & p <> 0.REAL 2 implies b1 . p = |[((p `1 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 ))))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or not p <> 0.REAL 2 or b1 . p = |[((p `1 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 ))))]| ) )
uniqueness
for b1, b2 being Function of the carrier of (TOP-REAL 2),the carrier of (TOP-REAL 2) st ( for p being Point of (TOP-REAL 2) holds
( ( p = 0.REAL 2 implies b1 . p = p ) & ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) & p <> 0.REAL 2 implies b1 . p = |[((p `1 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 ))))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or not p <> 0.REAL 2 or b1 . p = |[((p `1 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 ))))]| ) ) ) & ( for p being Point of (TOP-REAL 2) holds
( ( p = 0.REAL 2 implies b2 . p = p ) & ( ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) ) & p <> 0.REAL 2 implies b2 . p = |[((p `1 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `2 ) / (p `1 )) ^2 ))))]| ) & ( ( p `2 <= p `1 & - (p `1 ) <= p `2 ) or ( p `2 >= p `1 & p `2 <= - (p `1 ) ) or not p <> 0.REAL 2 or b2 . p = |[((p `1 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 )))),((p `2 ) / (sqrt (1 + (((p `1 ) / (p `2 )) ^2 ))))]| ) ) ) holds
b1 = b2
end;
:: deftheorem Def1 defines Sq_Circ JGRAPH_3:def 1 :
theorem Th14: :: JGRAPH_3:14
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th15: :: JGRAPH_3:15
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th16: :: JGRAPH_3:16
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th17: :: JGRAPH_3:17
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th18: :: JGRAPH_3:18
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th19: :: JGRAPH_3:19
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th20: :: JGRAPH_3:20
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm5:
for K1 being non empty Subset of (TOP-REAL 2)
for q being Point of ((TOP-REAL 2) | K1) holds (proj2 | K1) . q = proj2 . q
Lm6:
for K1 being non empty Subset of (TOP-REAL 2) holds proj2 | K1 is continuous Function of ((TOP-REAL 2) | K1),R^1
Lm7:
for K1 being non empty Subset of (TOP-REAL 2)
for q being Point of ((TOP-REAL 2) | K1) holds (proj1 | K1) . q = proj1 . q
Lm8:
for K1 being non empty Subset of (TOP-REAL 2) holds proj1 | K1 is continuous Function of ((TOP-REAL 2) | K1),R^1
theorem Th21: :: JGRAPH_3:21
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th22: :: JGRAPH_3:22
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th23: :: JGRAPH_3:23
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th24: :: JGRAPH_3:24
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm9:
( ( ( (1.REAL 2) `2 <= (1.REAL 2) `1 & - ((1.REAL 2) `1 ) <= (1.REAL 2) `2 ) or ( (1.REAL 2) `2 >= (1.REAL 2) `1 & (1.REAL 2) `2 <= - ((1.REAL 2) `1 ) ) ) & 1.REAL 2 <> 0.REAL 2 )
by JGRAPH_2:13, REVROT_1:19;
Lm10:
for K1 being non empty Subset of (TOP-REAL 2) holds dom (proj2 * (Sq_Circ | K1)) = the carrier of ((TOP-REAL 2) | K1)
Lm11:
for K1 being non empty Subset of (TOP-REAL 2) holds dom (proj1 * (Sq_Circ | K1)) = the carrier of ((TOP-REAL 2) | K1)
Lm12:
the carrier of (TOP-REAL 2) \ {(0.REAL 2)} <> {}
by JGRAPH_2:19;
theorem Th25: :: JGRAPH_3:25
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm13:
( ( ( (1.REAL 2) `1 <= (1.REAL 2) `2 & - ((1.REAL 2) `2 ) <= (1.REAL 2) `1 ) or ( (1.REAL 2) `1 >= (1.REAL 2) `2 & (1.REAL 2) `1 <= - ((1.REAL 2) `2 ) ) ) & 1.REAL 2 <> 0.REAL 2 )
by JGRAPH_2:13, REVROT_1:19;
theorem Th26: :: JGRAPH_3:26
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th27: :: JGRAPH_3:27
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th28: :: JGRAPH_3:28
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th29: :: JGRAPH_3:29
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th30: :: JGRAPH_3:30
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th31: :: JGRAPH_3:31
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th32: :: JGRAPH_3:32
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th33: :: JGRAPH_3:33
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th34: :: JGRAPH_3:34
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th35: :: JGRAPH_3:35
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JGRAPH_3:36
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JGRAPH_3:37
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th38: :: JGRAPH_3:38
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th39: :: JGRAPH_3:39
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th40: :: JGRAPH_3:40
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th41: :: JGRAPH_3:41
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th42: :: JGRAPH_3:42
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th43: :: JGRAPH_3:43
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th44: :: JGRAPH_3:44
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th45: :: JGRAPH_3:45
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th46: :: JGRAPH_3:46
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm14:
for K1 being non empty Subset of (TOP-REAL 2) holds proj2 * ((Sq_Circ " ) | K1) is Function of ((TOP-REAL 2) | K1),R^1
Lm15:
for K1 being non empty Subset of (TOP-REAL 2) holds proj1 * ((Sq_Circ " ) | K1) is Function of ((TOP-REAL 2) | K1),R^1
theorem Th47: :: JGRAPH_3:47
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th48: :: JGRAPH_3:48
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th49: :: JGRAPH_3:49
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th50: :: JGRAPH_3:50
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th51: :: JGRAPH_3:51
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem Th52: :: JGRAPH_3:52
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
Lm16:
Sq_Circ " is one-to-one
by FUNCT_1:62;
theorem :: JGRAPH_3:53
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
canceled;
theorem Th54: :: JGRAPH_3:54
:: Showing IDV graph ... (Click the Palm Tree again to close it) 
theorem :: JGRAPH_3:55
:: Showing IDV graph ... (Click the Palm Tree again to close it) 