:: GOBRD14 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
Euclid 2 = MetrStruct(# (REAL 2),(Pitag_dist 2) #)
by EUCLID:def 7;
theorem :: GOBRD14:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: GOBRD14:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: GOBRD14:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let n be
Nat;
let a,
b be
Point of
(TOP-REAL n);
func dist a,
b -> Real means :
Def1:
:: GOBRD14:def 1
ex
p,
q being
Point of
(Euclid n) st
(
p = a &
q = b &
it = dist p,
q );
existence
ex b1 being Real ex p, q being Point of (Euclid n) st
( p = a & q = b & b1 = dist p,q )
uniqueness
for b1, b2 being Real st ex p, q being Point of (Euclid n) st
( p = a & q = b & b1 = dist p,q ) & ex p, q being Point of (Euclid n) st
( p = a & q = b & b2 = dist p,q ) holds
b1 = b2
;
commutativity
for b1 being Real
for a, b being Point of (TOP-REAL n) st ex p, q being Point of (Euclid n) st
( p = a & q = b & b1 = dist p,q ) holds
ex p, q being Point of (Euclid n) st
( p = b & q = a & b1 = dist p,q )
;
end;
:: deftheorem Def1 defines dist GOBRD14:def 1 :
theorem Th9: :: GOBRD14:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: GOBRD14:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: GOBRD14:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
i,
j being
Nat for
G being
Go-board st 1
<= i &
i < len G & 1
<= j &
j < width G holds
cell G,
i,
j = product (1,2 --> [.((G * i,1) `1 ),((G * (i + 1),1) `1 ).],[.((G * 1,j) `2 ),((G * 1,(j + 1)) `2 ).])
theorem :: GOBRD14:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
i,
j being
Nat for
C being
compact non
horizontal non
vertical Subset of
(TOP-REAL 2) st
i <= j holds
for
a,
b being
Nat st 2
<= a &
a <= (len (Gauge C,i)) - 1 & 2
<= b &
b <= (len (Gauge C,i)) - 1 holds
ex
c,
d being
Nat st
( 2
<= c &
c <= (len (Gauge C,j)) - 1 & 2
<= d &
d <= (len (Gauge C,j)) - 1 &
[c,d] in Indices (Gauge C,j) &
(Gauge C,i) * a,
b = (Gauge C,j) * c,
d &
c = 2
+ ((2 |^ (j -' i)) * (a -' 2)) &
d = 2
+ ((2 |^ (j -' i)) * (b -' 2)) )
theorem Th19: :: GOBRD14:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
i,
j,
n being
Nat for
C being
compact non
horizontal non
vertical Subset of
(TOP-REAL 2) st
[i,j] in Indices (Gauge C,n) &
[i,(j + 1)] in Indices (Gauge C,n) holds
dist ((Gauge C,n) * i,j),
((Gauge C,n) * i,(j + 1)) = ((N-bound C) - (S-bound C)) / (2 |^ n)
theorem Th20: :: GOBRD14:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
i,
j,
n being
Nat for
C being
compact non
horizontal non
vertical Subset of
(TOP-REAL 2) st
[i,j] in Indices (Gauge C,n) &
[(i + 1),j] in Indices (Gauge C,n) holds
dist ((Gauge C,n) * i,j),
((Gauge C,n) * (i + 1),j) = ((E-bound C) - (W-bound C)) / (2 |^ n)
theorem :: GOBRD14:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
C being
compact non
horizontal non
vertical Subset of
(TOP-REAL 2) for
r,
t being
real number st
r > 0 &
t > 0 holds
ex
n being
Nat st
( 1
< n &
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 1,2) < r &
dist ((Gauge C,n) * 1,1),
((Gauge C,n) * 2,1) < t )
theorem Th22: :: GOBRD14:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: GOBRD14:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: GOBRD14:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th26: :: GOBRD14:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: GOBRD14:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: GOBRD14:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: GOBRD14:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: GOBRD14:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: GOBRD14:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: GOBRD14:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: GOBRD14:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: GOBRD14:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: GOBRD14:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th38: :: GOBRD14:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th39: :: GOBRD14:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th40: :: GOBRD14:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th41: :: GOBRD14:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th42: :: GOBRD14:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th43: :: GOBRD14:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th44: :: GOBRD14:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th46: :: GOBRD14:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: GOBRD14:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: GOBRD14:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: GOBRD14:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)