:: JORDAN12 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for R being Relation st R is trivial holds
dom R is trivial
Lm2:
for f being FinSequence st dom f is trivial holds
len f is trivial
Lm3:
for f being FinSequence st f is trivial holds
len f is trivial
theorem :: JORDAN12:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
i being
Nat st 1
< i holds
0
< i -' 1
theorem :: JORDAN12:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th3: :: JORDAN12:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: JORDAN12:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: JORDAN12:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: JORDAN12:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def1 defines is_in_general_position_wrt JORDAN12:def 1 :
:: deftheorem Def2 defines are_in_general_position JORDAN12:def 2 :
theorem Th7: :: JORDAN12:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: JORDAN12:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: JORDAN12:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: JORDAN12:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: JORDAN12:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: JORDAN12:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: JORDAN12:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: JORDAN12:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: JORDAN12:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: JORDAN12:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: JORDAN12:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: JORDAN12:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm4:
now
let G be
Go-board;
:: thesis: for i being Nat st i <= len G holds
for w1, w2 being Point of (TOP-REAL 2) st w1 in v_strip G,i & w2 in v_strip G,i & w1 `1 <= w2 `1 holds
LSeg w1,w2 c= v_strip G,ilet i be
Nat;
:: thesis: ( i <= len G implies for w1, w2 being Point of (TOP-REAL 2) st w1 in v_strip G,i & w2 in v_strip G,i & w1 `1 <= w2 `1 holds
LSeg w1,w2 c= v_strip G,i )assume A1:
i <= len G
;
:: thesis: for w1, w2 being Point of (TOP-REAL 2) st w1 in v_strip G,i & w2 in v_strip G,i & w1 `1 <= w2 `1 holds
LSeg w1,w2 c= v_strip G,ilet w1,
w2 be
Point of
(TOP-REAL 2);
:: thesis: ( w1 in v_strip G,i & w2 in v_strip G,i & w1 `1 <= w2 `1 implies LSeg w1,w2 c= v_strip G,i )assume that A2:
(
w1 in v_strip G,
i &
w2 in v_strip G,
i )
and A3:
w1 `1 <= w2 `1
;
:: thesis: LSeg w1,w2 c= v_strip G,ithus
LSeg w1,
w2 c= v_strip G,
i
:: thesis: verum
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in LSeg w1,w2 or x in v_strip G,i )
assume A4:
x in LSeg w1,
w2
;
:: thesis: x in v_strip G,i
reconsider p =
x as
Point of
(TOP-REAL 2) by A4;
A5:
p = |[(p `1 ),(p `2 )]|
by EUCLID:57;
A6:
(
w1 `1 <= p `1 &
p `1 <= w2 `1 )
by A3, A4, TOPREAL1:9;
per cases
( i = 0 or i = len G or ( 1 <= i & i < len G ) )
by A1, XREAL_1:1, NAT_1:39;
suppose
i = 0
;
:: thesis: x in v_strip G,i
then A7:
v_strip G,
i = { |[r,s]| where r, s is Real : r <= (G * 1,1) `1 }
by GOBRD11:18;
then consider r1,
s1 being
Real such that A8:
(
w2 = |[r1,s1]| &
r1 <= (G * 1,1) `1 )
by A2;
w2 `1 <= (G * 1,1) `1
by A8, EUCLID:56;
then
p `1 <= (G * 1,1) `1
by A6, XREAL_1:2;
hence
x in v_strip G,
i
by A5, A7;
:: thesis: verum
end;
suppose
i = len G
;
:: thesis: x in v_strip G,i
then A9:
v_strip G,
i = { |[r,s]| where r, s is Real : (G * (len G),1) `1 <= r }
by GOBRD11:19;
then consider r1,
s1 being
Real such that A10:
(
w1 = |[r1,s1]| &
(G * (len G),1) `1 <= r1 )
by A2;
(G * (len G),1) `1 <= w1 `1
by A10, EUCLID:56;
then
(G * (len G),1) `1 <= p `1
by A6, XREAL_1:2;
hence
x in v_strip G,
i
by A5, A9;
:: thesis: verum
end;
suppose
( 1
<= i &
i < len G )
;
:: thesis: x in v_strip G,i
then A11:
v_strip G,
i = { |[r,s]| where r, s is Real : ( (G * i,1) `1 <= r & r <= (G * (i + 1),1) `1 ) }
by GOBRD11:20;
then consider r1,
s1 being
Real such that A12:
(
w1 = |[r1,s1]| &
(G * i,1) `1 <= r1 &
r1 <= (G * (i + 1),1) `1 )
by A2;
(
(G * i,1) `1 <= w1 `1 &
w1 `1 <= (G * (i + 1),1) `1 )
by A12, EUCLID:56;
then A13:
(G * i,1) `1 <= p `1
by A6, XREAL_1:2;
consider r2,
s2 being
Real such that A14:
(
w2 = |[r2,s2]| &
(G * i,1) `1 <= r2 &
r2 <= (G * (i + 1),1) `1 )
by A2, A11;
(
(G * i,1) `1 <= w2 `1 &
w2 `1 <= (G * (i + 1),1) `1 )
by A14, EUCLID:56;
then
p `1 <= (G * (i + 1),1) `1
by A6, XREAL_1:2;
hence
x in v_strip G,
i
by A5, A11, A13;
:: thesis: verum
end;
end;
end;
end;
theorem Th19: :: JORDAN12:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm5:
now
let G be
Go-board;
:: thesis: for j being Nat st j <= width G holds
for w1, w2 being Point of (TOP-REAL 2) st w1 in h_strip G,j & w2 in h_strip G,j & w1 `2 <= w2 `2 holds
LSeg w1,w2 c= h_strip G,jlet j be
Nat;
:: thesis: ( j <= width G implies for w1, w2 being Point of (TOP-REAL 2) st w1 in h_strip G,j & w2 in h_strip G,j & w1 `2 <= w2 `2 holds
LSeg w1,w2 c= h_strip G,j )assume A1:
j <= width G
;
:: thesis: for w1, w2 being Point of (TOP-REAL 2) st w1 in h_strip G,j & w2 in h_strip G,j & w1 `2 <= w2 `2 holds
LSeg w1,w2 c= h_strip G,jlet w1,
w2 be
Point of
(TOP-REAL 2);
:: thesis: ( w1 in h_strip G,j & w2 in h_strip G,j & w1 `2 <= w2 `2 implies LSeg w1,w2 c= h_strip G,j )assume that A2:
(
w1 in h_strip G,
j &
w2 in h_strip G,
j )
and A3:
w1 `2 <= w2 `2
;
:: thesis: LSeg w1,w2 c= h_strip G,jthus
LSeg w1,
w2 c= h_strip G,
j
:: thesis: verum
proof
let x be
set ;
:: according to TARSKI:def 3 :: thesis: ( not x in LSeg w1,w2 or x in h_strip G,j )
assume A4:
x in LSeg w1,
w2
;
:: thesis: x in h_strip G,j
then reconsider p =
x as
Point of
(TOP-REAL 2) ;
A5:
p = |[(p `1 ),(p `2 )]|
by EUCLID:57;
A6:
(
w1 `2 <= p `2 &
p `2 <= w2 `2 )
by A3, A4, TOPREAL1:10;
per cases
( j = 0 or j = width G or ( 1 <= j & j < width G ) )
by A1, XREAL_1:1, NAT_1:39;
suppose
j = 0
;
:: thesis: x in h_strip G,j
then A7:
h_strip G,
j = { |[r,s]| where r, s is Real : s <= (G * 1,1) `2 }
by GOBRD11:21;
then consider r1,
s1 being
Real such that A8:
(
w2 = |[r1,s1]| &
s1 <= (G * 1,1) `2 )
by A2;
w2 `2 <= (G * 1,1) `2
by A8, EUCLID:56;
then
p `2 <= (G * 1,1) `2
by A6, XREAL_1:2;
hence
x in h_strip G,
j
by A5, A7;
:: thesis: verum
end;
suppose
j = width G
;
:: thesis: x in h_strip G,j
then A9:
h_strip G,
j = { |[r,s]| where r, s is Real : (G * 1,(width G)) `2 <= s }
by GOBRD11:22;
then consider r1,
s1 being
Real such that A10:
(
w1 = |[r1,s1]| &
(G * 1,(width G)) `2 <= s1 )
by A2;
(G * 1,(width G)) `2 <= w1 `2
by A10, EUCLID:56;
then
(G * 1,(width G)) `2 <= p `2
by A6, XREAL_1:2;
hence
x in h_strip G,
j
by A5, A9;
:: thesis: verum
end;
suppose
( 1
<= j &
j < width G )
;
:: thesis: x in h_strip G,j
then A11:
h_strip G,
j = { |[r,s]| where r, s is Real : ( (G * 1,j) `2 <= s & s <= (G * 1,(j + 1)) `2 ) }
by GOBRD11:23;
then consider r1,
s1 being
Real such that A12:
(
w1 = |[r1,s1]| &
(G * 1,j) `2 <= s1 &
s1 <= (G * 1,(j + 1)) `2 )
by A2;
(
(G * 1,j) `2 <= w1 `2 &
w1 `2 <= (G * 1,(j + 1)) `2 )
by A12, EUCLID:56;
then A13:
(G * 1,j) `2 <= p `2
by A6, XREAL_1:2;
consider r2,
s2 being
Real such that A14:
(
w2 = |[r2,s2]| &
(G * 1,j) `2 <= s2 &
s2 <= (G * 1,(j + 1)) `2 )
by A2, A11;
(
(G * 1,j) `2 <= w2 `2 &
w2 `2 <= (G * 1,(j + 1)) `2 )
by A14, EUCLID:56;
then
p `2 <= (G * 1,(j + 1)) `2
by A6, XREAL_1:2;
hence
x in h_strip G,
j
by A5, A11, A13;
:: thesis: verum
end;
end;
end;
end;
theorem Th20: :: JORDAN12:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: JORDAN12:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th22: :: JORDAN12:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: JORDAN12:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: JORDAN12:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: JORDAN12:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th26: :: JORDAN12:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: JORDAN12:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: JORDAN12:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: JORDAN12:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: JORDAN12:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: JORDAN12:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: JORDAN12:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: JORDAN12:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: JORDAN12:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: JORDAN12:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: JORDAN12:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)