let f be non constant standard special_circular_sequence; :: thesis: for i1, j1, i2, j2 being Element of NAT st i1 <= len (GoB f) & j1 <= width (GoB f) & i2 <= len (GoB f) & j2 <= width (GoB f) & ( j2 = j1 + 1 or j1 = j2 + 1 ) & i1 = i2 & Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) holds
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
let i1, j1, i2, j2 be Element of NAT ; :: thesis: ( i1 <= len (GoB f) & j1 <= width (GoB f) & i2 <= len (GoB f) & j2 <= width (GoB f) & ( j2 = j1 + 1 or j1 = j2 + 1 ) & i1 = i2 & Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) implies Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f) )
assume A1:
( i1 <= len (GoB f) & j1 <= width (GoB f) & i2 <= len (GoB f) & j2 <= width (GoB f) & ( j2 = j1 + 1 or j1 = j2 + 1 ) & i1 = i2 )
; :: thesis: ( not Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) or Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f) )
now assume A2:
Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)now per cases
( j2 = j1 + 1 or j1 = j2 + 1 )
by A1;
case A3:
j2 = j1 + 1
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)now per cases
( ex k being Element of NAT st
( 1 <= k & k + 1 <= len f & i2 <> 0 & i2 <> len (GoB f) & LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),((GoB f) * (i2 + 1),(j1 + 1)) ) or for k being Element of NAT holds
( not 1 <= k or not k + 1 <= len f or not i2 <> 0 or not i2 <> len (GoB f) or not LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),((GoB f) * (i2 + 1),(j1 + 1)) ) )
;
case
ex
k being
Element of
NAT st
( 1
<= k &
k + 1
<= len f &
i2 <> 0 &
i2 <> len (GoB f) &
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) )
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)then consider k being
Element of
NAT such that A4:
( 1
<= k &
k + 1
<= len f &
i2 <> 0 &
i2 <> len (GoB f) &
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) )
;
now per cases
( ( f /. k = (GoB f) * i2,(j1 + 1) & f /. (k + 1) = (GoB f) * (i2 + 1),(j1 + 1) ) or ( f /. k = (GoB f) * (i2 + 1),(j1 + 1) & f /. (k + 1) = (GoB f) * i2,(j1 + 1) ) )
by A4, SPPOL_1:25;
case A5:
(
f /. k = (GoB f) * i2,
(j1 + 1) &
f /. (k + 1) = (GoB f) * (i2 + 1),
(j1 + 1) )
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)A6:
Indices (GoB f) = [:(dom (GoB f)),(Seg (width (GoB f))):]
by MATRIX_1:def 5;
0 + 1
<= j1 + 1
by XREAL_1:8;
then A7:
j1 + 1
in Seg (width (GoB f))
by A1, A3, FINSEQ_1:3;
i2 > 0
by A4;
then
i2 >= 0 + 1
by NAT_1:13;
then
i2 in dom (GoB f)
by A1, FINSEQ_3:27;
then A8:
[i2,(j1 + 1)] in Indices (GoB f)
by A6, A7, ZFMISC_1:106;
i2 < len (GoB f)
by A1, A4, XXREAL_0:1;
then A9:
i2 + 1
<= len (GoB f)
by NAT_1:13;
1
<= i2 + 1
by NAT_1:11;
then
i2 + 1
in dom (GoB f)
by A9, FINSEQ_3:27;
then
[(i2 + 1),(j1 + 1)] in Indices (GoB f)
by A6, A7, ZFMISC_1:106;
then A10:
left_cell f,
k = cell (GoB f),
i2,
(j1 + 1)
by A4, A5, A8, GOBOARD5:29;
A11:
Int (left_cell f,k) c= LeftComp f
by A4, GOBOARD9:24;
LeftComp f c= (LeftComp f) \/ (RightComp f)
by XBOOLE_1:7;
hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
by A10, A11, XBOOLE_1:1;
:: thesis: verum end; case A12:
(
f /. k = (GoB f) * (i2 + 1),
(j1 + 1) &
f /. (k + 1) = (GoB f) * i2,
(j1 + 1) )
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)A13:
Indices (GoB f) = [:(dom (GoB f)),(Seg (width (GoB f))):]
by MATRIX_1:def 5;
0 + 1
<= j1 + 1
by XREAL_1:8;
then A14:
j1 + 1
in Seg (width (GoB f))
by A1, A3, FINSEQ_1:3;
i2 > 0
by A4;
then
i2 >= 0 + 1
by NAT_1:13;
then
i2 in dom (GoB f)
by A1, FINSEQ_3:27;
then A15:
[i2,(j1 + 1)] in Indices (GoB f)
by A13, A14, ZFMISC_1:106;
i2 < len (GoB f)
by A1, A4, XXREAL_0:1;
then A16:
i2 + 1
<= len (GoB f)
by NAT_1:13;
1
<= i2 + 1
by NAT_1:11;
then
i2 + 1
in dom (GoB f)
by A16, FINSEQ_3:27;
then
[(i2 + 1),(j1 + 1)] in Indices (GoB f)
by A13, A14, ZFMISC_1:106;
then A17:
right_cell f,
k = cell (GoB f),
i2,
(j1 + 1)
by A4, A12, A15, GOBOARD5:30;
A18:
Int (right_cell f,k) c= RightComp f
by A4, GOBOARD9:28;
RightComp f c= (LeftComp f) \/ (RightComp f)
by XBOOLE_1:7;
hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
by A17, A18, XBOOLE_1:1;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: verum end; case A19:
for
k being
Element of
NAT holds
( not 1
<= k or not
k + 1
<= len f or not
i2 <> 0 or not
i2 <> len (GoB f) or not
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) )
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)now per cases
( i2 = 0 or i2 = len (GoB f) or ( i2 <> 0 & i2 <> len (GoB f) & ( for k being Element of NAT holds
( not 1 <= k or not k + 1 <= len f or not LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),((GoB f) * (i2 + 1),(j1 + 1)) ) ) ) )
by A19;
case A20:
i2 = 0
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)reconsider p =
|[((((GoB f) * 1,(j1 + 1)) `1 ) - 1),(((GoB f) * 1,(j1 + 1)) `2 )]| as
Point of
(TOP-REAL 2) ;
A21:
1
< len (GoB f)
by GOBOARD7:34;
A22:
1
< width (GoB f)
by GOBOARD7:35;
A23:
1
<= 1
+ j1
by NAT_1:11;
then
((GoB f) * 1,(j1 + 1)) `1 = ((GoB f) * 1,1) `1
by A1, A3, A21, GOBOARD5:3;
then A24:
p `1 = (((GoB f) * 1,1) `1 ) - 1
by EUCLID:56;
A25:
p `1 < (p `1 ) + 1
by XREAL_1:31;
A26:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
q being
Point of
(TOP-REAL 2) st
q in P holds
q `1 < ((GoB f) * 1,1) `1 ) implies
P misses L~ f )
by GOBOARD8:21;
then A27:
{p} c= (L~ f) `
by A24, A25, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A26, PRE_TOPC:29;
p in { |[s,r]| where s, r is Real : s <= ((GoB f) * 1,1) `1 }
then A28:
p in v_strip (GoB f),
i2
by A20, A22, GOBOARD5:11;
A29:
(
j1 = 0 or
j1 >= 0 + 1 )
by NAT_1:13;
now per cases
( ( j1 >= 1 & j1 + 1 < width (GoB f) ) or ( j1 >= 1 & j1 + 1 = width (GoB f) ) or ( j1 = 0 & j1 + 1 < width (GoB f) ) or ( j1 = 0 & j1 + 1 = width (GoB f) ) )
by A1, A3, A29, XXREAL_0:1;
case A30:
(
j1 >= 1 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then A31:
( 1
<= j1 + 1 &
j1 + 1
< width (GoB f) )
by NAT_1:11;
A32:
( 1
<= j1 &
j1 < width (GoB f) )
by A30, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
then A33:
p in h_strip (GoB f),
j1
by A21, A32, GOBOARD5:6;
A34:
(j1 + 1) + 1
<= width (GoB f)
by A30, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
proof
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * 1,(j1 + 1)) `2 <= ((GoB f) * 1,(j1 + 1)) `2 &
((GoB f) * 1,(j1 + 1)) `2 <= ((GoB f) * 1,((j1 + 1) + 1)) `2 )
by A21, A23, A34, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A21, A31, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A28, A33, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A26, A27, XBOOLE_0:def 4;
:: thesis: verum end; case A35:
(
j1 >= 1 &
j1 + 1
= width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )A36:
j1 < j1 + 1
by NAT_1:13;
A37:
( 1
<= j1 &
j1 < width (GoB f) )
by A35, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
then A38:
p in h_strip (GoB f),
j1
by A21, A37, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j1 + 1)) `2 <= r }
;
then
p in h_strip (GoB f),
(j1 + 1)
by A21, A35, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A28, A38, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A26, A27, XBOOLE_0:def 4;
:: thesis: verum end; case A39:
(
j1 = 0 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
;
then A40:
p in h_strip (GoB f),
j1
by A21, A39, GOBOARD5:8;
A41:
(j1 + 1) + 1
<= width (GoB f)
by A39, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
proof
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * 1,(j1 + 1)) `2 <= ((GoB f) * 1,(j1 + 1)) `2 &
((GoB f) * 1,(j1 + 1)) `2 <= ((GoB f) * 1,((j1 + 1) + 1)) `2 )
by A21, A23, A41, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A21, A39, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A28, A40, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A26, A27, XBOOLE_0:def 4;
:: thesis: verum end; case A42:
(
j1 = 0 &
j1 + 1
= width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
;
then A43:
p in h_strip (GoB f),
j1
by A21, A42, GOBOARD5:8;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j1 + 1)) `2 <= r }
;
then
p in h_strip (GoB f),
(j1 + 1)
by A21, A42, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A28, A43, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A26, A27, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A44:
(
p in Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) )
by A1, Th3;
A45:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A45, GOBRD11:4;
then A46:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A47:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) is
connected
by A1, A3, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A48:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A49:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A50:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A48, A49, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A51:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A44, A46, A50, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= Component_of p1
by A44, A47, GOBRD11:1;
then A52:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A51, XBOOLE_1:1;
A53:
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) = Int (cell (GoB f),i2,(j1 + 1))
by A1, A3, Th4;
hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
by A45, A52, A53, XBOOLE_1:1;
:: thesis: verum end; case A54:
i2 = len (GoB f)
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)reconsider p =
|[((((GoB f) * (len (GoB f)),(j1 + 1)) `1 ) + 1),(((GoB f) * (len (GoB f)),(j1 + 1)) `2 )]| as
Point of
(TOP-REAL 2) ;
A55:
1
< len (GoB f)
by GOBOARD7:34;
A56:
1
< width (GoB f)
by GOBOARD7:35;
A57:
1
<= 1
+ j1
by NAT_1:11;
then
((GoB f) * (len (GoB f)),(j1 + 1)) `1 = ((GoB f) * (len (GoB f)),1) `1
by A1, A3, A55, GOBOARD5:3;
then A58:
p `1 = (((GoB f) * (len (GoB f)),1) `1 ) + 1
by EUCLID:56;
A59:
((GoB f) * (len (GoB f)),1) `1 < (((GoB f) * (len (GoB f)),1) `1 ) + 1
by XREAL_1:31;
A60:
((GoB f) * (len (GoB f)),1) `1 < p `1
by A58, XREAL_1:31;
A61:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
q being
Point of
(TOP-REAL 2) st
q in P holds
((GoB f) * (len (GoB f)),1) `1 < q `1 ) implies
P misses L~ f )
by GOBOARD8:22;
then A62:
{p} c= (L~ f) `
by A58, A59, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A61, PRE_TOPC:29;
p in { |[s,r]| where s, r is Real : ((GoB f) * (len (GoB f)),1) `1 <= s }
then A63:
p in v_strip (GoB f),
i2
by A54, A56, GOBOARD5:10;
A64:
(
j1 = 0 or
j1 >= 0 + 1 )
by NAT_1:13;
now per cases
( ( j1 >= 1 & j1 + 1 < width (GoB f) ) or ( j1 >= 1 & j1 + 1 = width (GoB f) ) or ( j1 = 0 & j1 + 1 < width (GoB f) ) or ( j1 = 0 & j1 + 1 = width (GoB f) ) )
by A1, A3, A64, XXREAL_0:1;
case A65:
(
j1 >= 1 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then A66:
( 1
<= j1 + 1 &
j1 + 1
< width (GoB f) )
by NAT_1:11;
A67:
( 1
<= j1 &
j1 < width (GoB f) )
by A65, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j1) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j1 + 1)) `2 ) }
then A68:
p in h_strip (GoB f),
j1
by A55, A67, GOBOARD5:6;
A69:
(j1 + 1) + 1
<= width (GoB f)
by A65, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 ) }
proof
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= ((GoB f) * (len (GoB f)),(j1 + 1)) `2 &
((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 )
by A55, A57, A69, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A55, A66, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A63, A68, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A61, A62, XBOOLE_0:def 4;
:: thesis: verum end; case A70:
(
j1 >= 1 &
j1 + 1
= width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )A71:
j1 < j1 + 1
by NAT_1:13;
A72:
( 1
<= j1 &
j1 < width (GoB f) )
by A70, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j1) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j1 + 1)) `2 ) }
then A73:
p in h_strip (GoB f),
j1
by A55, A72, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= r }
;
then
p in h_strip (GoB f),
(j1 + 1)
by A55, A70, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A63, A73, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A61, A62, XBOOLE_0:def 4;
:: thesis: verum end; case A74:
(
j1 = 0 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * (len (GoB f)),1) `2 }
;
then A75:
p in h_strip (GoB f),
j1
by A55, A74, GOBOARD5:8;
A76:
(j1 + 1) + 1
<= width (GoB f)
by A74, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 ) }
proof
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= ((GoB f) * (len (GoB f)),(j1 + 1)) `2 &
((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 )
by A55, A57, A76, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j1 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j1 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A55, A74, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A63, A75, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A61, A62, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A77:
(
p in Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) )
by A1, Th3;
A78:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A78, GOBRD11:4;
then A79:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A80:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) is
connected
by A1, A3, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A81:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A82:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A83:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A81, A82, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A84:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A77, A79, A83, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= Component_of p1
by A77, A80, GOBRD11:1;
then A85:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A84, XBOOLE_1:1;
A86:
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) = Int (cell (GoB f),i2,(j1 + 1))
by A1, A3, Th4;
hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
by A78, A85, A86, XBOOLE_1:1;
:: thesis: verum end; case A87:
(
i2 <> 0 &
i2 <> len (GoB f) & ( for
k being
Element of
NAT holds
( not 1
<= k or not
k + 1
<= len f or not
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) ) ) )
;
:: thesis: Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)then
0 < i2
;
then A88:
0 + 1
<= i2
by NAT_1:13;
A89:
i2 < len (GoB f)
by A1, A87, XXREAL_0:1;
then A90:
i2 + 1
<= len (GoB f)
by NAT_1:13;
for
k being
Element of
NAT st 1
<= k &
k + 1
<= len f holds
LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) <> LSeg f,
k
proof
let k be
Element of
NAT ;
:: thesis: ( 1 <= k & k + 1 <= len f implies LSeg ((GoB f) * i2,(j1 + 1)),((GoB f) * (i2 + 1),(j1 + 1)) <> LSeg f,k )
assume A91:
( 1
<= k &
k + 1
<= len f )
;
:: thesis: LSeg ((GoB f) * i2,(j1 + 1)),((GoB f) * (i2 + 1),(j1 + 1)) <> LSeg f,k
then
LSeg f,
k = LSeg (f /. k),
(f /. (k + 1))
by TOPREAL1:def 5;
hence
LSeg ((GoB f) * i2,(j1 + 1)),
((GoB f) * (i2 + 1),(j1 + 1)) <> LSeg f,
k
by A87, A91;
:: thesis: verum
end; then A92:
( 1
<= j1 + 1 &
j1 + 1
<= width (GoB f) & 1
<= i2 &
i2 + 1
<= len (GoB f) implies not
(1 / 2) * (((GoB f) * i2,(j1 + 1)) + ((GoB f) * (i2 + 1),(j1 + 1))) in L~ f )
by GOBOARD7:42;
reconsider p =
(1 / 2) * (((GoB f) * i2,(j1 + 1)) + ((GoB f) * (i2 + 1),(j1 + 1))) as
Point of
(TOP-REAL 2) ;
A93:
p `2 =
(1 / 2) * ((((GoB f) * i2,(j1 + 1)) + ((GoB f) * (i2 + 1),(j1 + 1))) `2 )
by TOPREAL3:9
.=
(1 / 2) * ((((GoB f) * i2,(j1 + 1)) `2 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `2 ))
by TOPREAL3:7
;
A94:
p `1 =
(1 / 2) * ((((GoB f) * i2,(j1 + 1)) + ((GoB f) * (i2 + 1),(j1 + 1))) `1 )
by TOPREAL3:9
.=
(1 / 2) * ((((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 ))
by TOPREAL3:7
;
then A95:
p = |[((1 / 2) * ((((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 ))),((1 / 2) * ((((GoB f) * i2,(j1 + 1)) `2 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `2 )))]|
by A93, EUCLID:57;
A96:
1
< len (GoB f)
by GOBOARD7:34;
A97:
1
<= 1
+ j1
by NAT_1:11;
A98:
i2 < i2 + 1
by NAT_1:13;
A99:
1
< i2 + 1
by A88, NAT_1:13;
A100:
((GoB f) * i2,(j1 + 1)) `1 < ((GoB f) * (i2 + 1),(j1 + 1)) `1
by A1, A3, A88, A90, A97, A98, GOBOARD5:4;
then A101:
(((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * i2,(j1 + 1)) `1 ) < (((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 )
by XREAL_1:10;
A102:
(((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 ) < (((GoB f) * (i2 + 1),(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 )
by A100, XREAL_1:10;
A103:
((((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * i2,(j1 + 1)) `1 )) / 2
< ((((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 )) / 2
by A101, XREAL_1:76;
A104:
((((GoB f) * i2,(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 )) / 2
< ((((GoB f) * (i2 + 1),(j1 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j1 + 1)) `1 )) / 2
by A102, XREAL_1:76;
A105:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
x being
set st
x in P holds
not
x in L~ f ) implies
P misses L~ f )
by XBOOLE_0:3;
then A106:
{p} c= (L~ f) `
by A1, A3, A88, A89, A92, NAT_1:13, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A105, PRE_TOPC:29;
A107:
( 1
<= j1 + 1 &
j1 + 1
<= width (GoB f) )
by A1, A3, NAT_1:11;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * i2,(j1 + 1)) `1 <= s & s <= ((GoB f) * (i2 + 1),(j1 + 1)) `1 ) }
proof
(
p = |[(p `1 ),(p `2 )]| &
((GoB f) * i2,(j1 + 1)) `1 <= p `1 &
p `1 <= ((GoB f) * (i2 + 1),(j1 + 1)) `1 )
by A94, A103, A104, EUCLID:57;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * i2,(j1 + 1)) `1 <= s & s <= ((GoB f) * (i2 + 1),(j1 + 1)) `1 ) }
;
:: thesis: verum
end; then A108:
p in v_strip (GoB f),
i2
by A88, A89, A107, GOBOARD5:9;
A109:
(
j1 = 0 or
j1 >= 0 + 1 )
by NAT_1:13;
now per cases
( ( j1 >= 1 & j1 + 1 < width (GoB f) ) or ( j1 >= 1 & j1 + 1 = width (GoB f) ) or ( j1 = 0 & j1 + 1 < width (GoB f) ) or ( j1 = 0 & j1 + 1 = width (GoB f) ) )
by A1, A3, A109, XXREAL_0:1;
case A110:
(
j1 >= 1 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )then A111:
( 1
<= j1 + 1 &
j1 + 1
< width (GoB f) )
by NAT_1:11;
A112:
( 1
<= j1 &
j1 < width (GoB f) )
by A110, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
proof
A113:
j1 < j1 + 1
by NAT_1:13;
A114:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
A115:
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
((GoB f) * 1,j1) `2 < ((GoB f) * 1,(j1 + 1)) `2
by A96, A110, A113, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
by A95, A114, A115;
:: thesis: verum
end; then A116:
p in h_strip (GoB f),
j1
by A96, A112, GOBOARD5:6;
A117:
(j1 + 1) + 1
<= width (GoB f)
by A110, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
proof
A118:
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
A119:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
A120:
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
((GoB f) * 1,(j1 + 1)) `2 < ((GoB f) * 1,((j1 + 1) + 1)) `2
by A96, A97, A117, A118, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
by A95, A119, A120;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A96, A111, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A108, A116, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A105, A106, XBOOLE_0:def 4;
:: thesis: verum end; case A121:
(
j1 >= 1 &
j1 + 1
= width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )A122:
j1 < j1 + 1
by NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
proof
A123:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
A124:
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
((GoB f) * 1,j1) `2 < ((GoB f) * 1,(j1 + 1)) `2
by A96, A121, A122, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j1) `2 <= r & r <= ((GoB f) * 1,(j1 + 1)) `2 ) }
by A95, A123, A124;
:: thesis: verum
end; then A125:
p in h_strip (GoB f),
j1
by A96, A121, A122, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j1 + 1)) `2 <= r }
proof
A126:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
hence
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j1 + 1)) `2 <= r }
by A95, A126;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A96, A121, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A108, A125, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A105, A106, XBOOLE_0:def 4;
:: thesis: verum end; case A127:
(
j1 = 0 &
j1 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
proof
A128:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
hence
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
by A95, A127, A128;
:: thesis: verum
end; then A129:
p in h_strip (GoB f),
j1
by A96, A127, GOBOARD5:8;
A130:
(j1 + 1) + 1
<= width (GoB f)
by A127, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
proof
A131:
j1 + 1
< (j1 + 1) + 1
by NAT_1:13;
A132:
((GoB f) * i2,(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A88, A97, GOBOARD5:2;
A133:
((GoB f) * (i2 + 1),(j1 + 1)) `2 = ((GoB f) * 1,(j1 + 1)) `2
by A1, A3, A90, A97, A99, GOBOARD5:2;
((GoB f) * 1,(j1 + 1)) `2 < ((GoB f) * 1,((j1 + 1) + 1)) `2
by A96, A97, A130, A131, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j1 + 1)) `2 <= r & r <= ((GoB f) * 1,((j1 + 1) + 1)) `2 ) }
by A95, A132, A133;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j1 + 1)
by A96, A127, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j1) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j1 + 1)) /\ (v_strip (GoB f),i2) )
by A108, A129, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j1 &
p in cell (GoB f),
i2,
(j1 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j1 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j1) /\ ((L~ f) ` ) )
by A105, A106, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A134:
(
p in Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) )
by A1, Th3;
A135:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A135, GOBRD11:4;
then A136:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A137:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) is
connected
by A1, A3, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A138:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A139:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A140:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A138, A139, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A141:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A134, A136, A140, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= Component_of p1
by A134, A137, GOBRD11:1;
then A142:
Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A141, XBOOLE_1:1;
A143:
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,(j1 + 1))),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,(j1 + 1))),
((L~ f) ` ) = Int (cell (GoB f),i2,(j1 + 1))
by A1, A3, Th4;
hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
by A135, A142, A143, XBOOLE_1:1;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,(j1 + 1)) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
by A3;
:: thesis: verum end; case A144:
j1 = j2 + 1
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)then A145:
j1 -' 1
= j2
by NAT_D:34;
A146:
j2 < j2 + 1
by NAT_1:13;
A147:
j2 < j1
by A144, NAT_1:13;
A148:
1
<= j2 + 1
by NAT_1:11;
A149:
1
<= j1
by A144, NAT_1:11;
A150:
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
A151:
j1 -' 1
= j1 - 1
by A144, XREAL_0:def 2;
A152:
1
<= (j1 -' 1) + 1
by NAT_1:11;
A153:
j1 -' 1
< j1
by A144, A147, NAT_D:34;
now per cases
( ex k being Element of NAT st
( 1 <= k & k + 1 <= len f & i2 <> 0 & i2 <> len (GoB f) & LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),((GoB f) * (i2 + 1),(j2 + 1)) ) or for k being Element of NAT holds
( not 1 <= k or not k + 1 <= len f or not i2 <> 0 or not i2 <> len (GoB f) or not LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),((GoB f) * (i2 + 1),(j2 + 1)) ) )
;
case
ex
k being
Element of
NAT st
( 1
<= k &
k + 1
<= len f &
i2 <> 0 &
i2 <> len (GoB f) &
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),
((GoB f) * (i2 + 1),(j2 + 1)) )
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)then consider k being
Element of
NAT such that A154:
( 1
<= k &
k + 1
<= len f &
i2 <> 0 &
i2 <> len (GoB f) &
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,((j1 -' 1) + 1)),
((GoB f) * (i2 + 1),((j1 -' 1) + 1)) )
by A145;
now per cases
( ( f /. k = (GoB f) * i2,((j1 -' 1) + 1) & f /. (k + 1) = (GoB f) * (i2 + 1),((j1 -' 1) + 1) ) or ( f /. k = (GoB f) * (i2 + 1),((j1 -' 1) + 1) & f /. (k + 1) = (GoB f) * i2,((j1 -' 1) + 1) ) )
by A154, SPPOL_1:25;
case A155:
(
f /. k = (GoB f) * i2,
((j1 -' 1) + 1) &
f /. (k + 1) = (GoB f) * (i2 + 1),
((j1 -' 1) + 1) )
;
:: thesis: Int (cell (GoB f),i2,(j1 -' 1)) c= (LeftComp f) \/ (RightComp f)A156:
Indices (GoB f) = [:(dom (GoB f)),(Seg (width (GoB f))):]
by MATRIX_1:def 5;
j1 -' 1
< width (GoB f)
by A1, A153, XXREAL_0:2;
then
(j1 -' 1) + 1
<= width (GoB f)
by NAT_1:13;
then A157:
(j1 -' 1) + 1
in Seg (width (GoB f))
by A152, FINSEQ_1:3;
i2 > 0
by A154;
then
i2 >= 0 + 1
by NAT_1:13;
then
i2 in dom (GoB f)
by A1, FINSEQ_3:27;
then A158:
[i2,((j1 -' 1) + 1)] in Indices (GoB f)
by A156, A157, ZFMISC_1:106;
i2 < len (GoB f)
by A1, A154, XXREAL_0:1;
then A159:
i2 + 1
<= len (GoB f)
by NAT_1:13;
1
<= i2 + 1
by NAT_1:11;
then
i2 + 1
in dom (GoB f)
by A159, FINSEQ_3:27;
then
[(i2 + 1),((j1 -' 1) + 1)] in Indices (GoB f)
by A156, A157, ZFMISC_1:106;
then A160:
right_cell f,
k = cell (GoB f),
i2,
(j1 -' 1)
by A154, A155, A158, GOBOARD5:29;
A161:
Int (right_cell f,k) c= RightComp f
by A154, GOBOARD9:28;
RightComp f c= (LeftComp f) \/ (RightComp f)
by XBOOLE_1:7;
hence
Int (cell (GoB f),i2,(j1 -' 1)) c= (LeftComp f) \/ (RightComp f)
by A160, A161, XBOOLE_1:1;
:: thesis: verum end; case A162:
(
f /. k = (GoB f) * (i2 + 1),
((j1 -' 1) + 1) &
f /. (k + 1) = (GoB f) * i2,
((j1 -' 1) + 1) )
;
:: thesis: Int (cell (GoB f),i2,(j1 -' 1)) c= (LeftComp f) \/ (RightComp f)A163:
Indices (GoB f) = [:(dom (GoB f)),(Seg (width (GoB f))):]
by MATRIX_1:def 5;
A164:
(j1 -' 1) + 1
in Seg (width (GoB f))
by A1, A149, A151, FINSEQ_1:3;
i2 > 0
by A154;
then
i2 >= 0 + 1
by NAT_1:13;
then
i2 in dom (GoB f)
by A1, FINSEQ_3:27;
then A165:
[i2,((j1 -' 1) + 1)] in Indices (GoB f)
by A163, A164, ZFMISC_1:106;
i2 < len (GoB f)
by A1, A154, XXREAL_0:1;
then A166:
i2 + 1
<= len (GoB f)
by NAT_1:13;
1
<= i2 + 1
by NAT_1:11;
then
i2 + 1
in dom (GoB f)
by A166, FINSEQ_3:27;
then
[(i2 + 1),((j1 -' 1) + 1)] in Indices (GoB f)
by A163, A164, ZFMISC_1:106;
then A167:
left_cell f,
k = cell (GoB f),
i2,
(j1 -' 1)
by A154, A162, A165, GOBOARD5:30;
A168:
Int (left_cell f,k) c= LeftComp f
by A154, GOBOARD9:24;
LeftComp f c= (LeftComp f) \/ (RightComp f)
by XBOOLE_1:7;
hence
Int (cell (GoB f),i2,(j1 -' 1)) c= (LeftComp f) \/ (RightComp f)
by A167, A168, XBOOLE_1:1;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
by A144, NAT_D:34;
:: thesis: verum end; case A169:
for
k being
Element of
NAT holds
( not 1
<= k or not
k + 1
<= len f or not
i2 <> 0 or not
i2 <> len (GoB f) or not
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),
((GoB f) * (i2 + 1),(j2 + 1)) )
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)now per cases
( i2 = 0 or i2 = len (GoB f) or ( i2 <> 0 & i2 <> len (GoB f) & ( for k being Element of NAT holds
( not 1 <= k or not k + 1 <= len f or not LSeg (f /. k),(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),((GoB f) * (i2 + 1),(j2 + 1)) ) ) ) )
by A169;
case A170:
i2 = 0
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)reconsider p =
|[((((GoB f) * 1,(j2 + 1)) `1 ) - 1),(((GoB f) * 1,(j2 + 1)) `2 )]| as
Point of
(TOP-REAL 2) ;
A171:
1
< len (GoB f)
by GOBOARD7:34;
A172:
1
< width (GoB f)
by GOBOARD7:35;
A173:
1
<= j2 + 1
by NAT_1:11;
then
((GoB f) * 1,(j2 + 1)) `1 = ((GoB f) * 1,1) `1
by A1, A144, A171, GOBOARD5:3;
then A174:
p `1 = (((GoB f) * 1,1) `1 ) - 1
by EUCLID:56;
A175:
p `1 < (p `1 ) + 1
by XREAL_1:31;
A176:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
q being
Point of
(TOP-REAL 2) st
q in P holds
q `1 < ((GoB f) * 1,1) `1 ) implies
P misses L~ f )
by GOBOARD8:21;
then A177:
{p} c= (L~ f) `
by A174, A175, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A176, PRE_TOPC:29;
p in { |[s,r]| where s, r is Real : s <= ((GoB f) * 1,1) `1 }
then A178:
p in v_strip (GoB f),
i2
by A170, A172, GOBOARD5:11;
now per cases
( ( j2 + 1 < width (GoB f) & j2 > 0 ) or ( j2 + 1 < width (GoB f) & j2 = 0 ) or ( j2 + 1 = width (GoB f) & j2 > 0 ) or ( j2 + 1 = width (GoB f) & j2 = 0 ) )
by A1, A144, XXREAL_0:1;
case A179:
(
j2 + 1
< width (GoB f) &
j2 > 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A180:
0 + 1
<= j2
by NAT_1:13;
then A181:
( 1
<= j2 + 1 &
j2 + 1
< width (GoB f) )
by A179, NAT_1:13;
A182:
( 1
<= j2 &
j2 < width (GoB f) )
by A179, A180, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
proof
j2 < j2 + 1
by NAT_1:13;
then
((GoB f) * 1,j2) `2 < ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A171, A180, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
;
:: thesis: verum
end; then A183:
p in h_strip (GoB f),
j2
by A171, A182, GOBOARD5:6;
A184:
(j2 + 1) + 1
<= width (GoB f)
by A179, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
proof
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * 1,(j2 + 1)) `2 <= ((GoB f) * 1,(j2 + 1)) `2 &
((GoB f) * 1,(j2 + 1)) `2 <= ((GoB f) * 1,((j2 + 1) + 1)) `2 )
by A171, A173, A184, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A171, A181, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A178, A183, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A176, A177, XBOOLE_0:def 4;
:: thesis: verum end; case A185:
(
j2 + 1
< width (GoB f) &
j2 = 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A186:
(j2 + 1) + 1
<= width (GoB f)
by NAT_1:13;
A187:
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,(j2 + 1)) `2 }
;
then A188:
p in h_strip (GoB f),
j2
by A171, A185, GOBOARD5:8;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
proof
((GoB f) * 1,(j2 + 1)) `2 < ((GoB f) * 1,((j2 + 1) + 1)) `2
by A148, A171, A186, A187, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A171, A185, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A178, A188, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A176, A177, XBOOLE_0:def 4;
:: thesis: verum end; case A189:
(
j2 + 1
= width (GoB f) &
j2 > 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A190:
0 + 1
<= j2
by NAT_1:13;
then A191:
( 1
<= j2 &
j2 < width (GoB f) )
by A189, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
proof
((GoB f) * 1,j2) `2 < ((GoB f) * 1,(j2 + 1)) `2
by A146, A171, A189, A190, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
;
:: thesis: verum
end; then A192:
p in h_strip (GoB f),
j2
by A171, A191, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j2 + 1)) `2 <= r }
;
then
p in h_strip (GoB f),
(j2 + 1)
by A171, A189, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A178, A192, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A176, A177, XBOOLE_0:def 4;
:: thesis: verum end; case A193:
(
j2 + 1
= width (GoB f) &
j2 = 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
;
then A194:
p in h_strip (GoB f),
j2
by A171, A193, GOBOARD5:8;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j2 + 1)) `2 <= r }
;
then
p in h_strip (GoB f),
(j2 + 1)
by A171, A193, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A178, A194, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A176, A177, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A195:
(
p in Cl (Down (Int (cell (GoB f),i2,(j2 + 1))),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) )
by A1, Th3;
A196:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A196, GOBRD11:4;
then A197:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A198:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) is
connected
by A1, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A199:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A200:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A201:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A199, A200, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A202:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A144, A195, A197, A201, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= Component_of p1
by A195, A198, GOBRD11:1;
then A203:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A202, XBOOLE_1:1;
A204:
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) = Int (cell (GoB f),i2,j2)
by A1, Th4;
hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
by A196, A203, A204, XBOOLE_1:1;
:: thesis: verum end; case A205:
i2 = len (GoB f)
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)reconsider p =
|[((((GoB f) * (len (GoB f)),(j2 + 1)) `1 ) + 1),(((GoB f) * (len (GoB f)),(j2 + 1)) `2 )]| as
Point of
(TOP-REAL 2) ;
A206:
1
< len (GoB f)
by GOBOARD7:34;
A207:
1
< width (GoB f)
by GOBOARD7:35;
1
<= j2 + 1
by NAT_1:11;
then
((GoB f) * (len (GoB f)),(j2 + 1)) `1 = ((GoB f) * (len (GoB f)),1) `1
by A1, A144, A206, GOBOARD5:3;
then A208:
p `1 = (((GoB f) * (len (GoB f)),1) `1 ) + 1
by EUCLID:56;
A209:
((GoB f) * (len (GoB f)),1) `1 < (((GoB f) * (len (GoB f)),1) `1 ) + 1
by XREAL_1:31;
A210:
((GoB f) * (len (GoB f)),1) `1 < p `1
by A208, XREAL_1:31;
A211:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
q being
Point of
(TOP-REAL 2) st
q in P holds
((GoB f) * (len (GoB f)),1) `1 < q `1 ) implies
P misses L~ f )
by GOBOARD8:22;
then A212:
{p} c= (L~ f) `
by A208, A209, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A211, PRE_TOPC:29;
p in { |[s,r]| where s, r is Real : ((GoB f) * (len (GoB f)),1) `1 <= s }
then A213:
p in v_strip (GoB f),
i2
by A205, A207, GOBOARD5:10;
now per cases
( ( j2 + 1 < width (GoB f) & j2 > 0 ) or ( j2 + 1 < width (GoB f) & j2 = 0 ) or ( j2 + 1 = width (GoB f) & j2 > 0 ) or ( j2 + 1 = width (GoB f) & j2 = 0 ) )
by A1, A144, XXREAL_0:1;
case A214:
(
j2 + 1
< width (GoB f) &
j2 > 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A215:
(j2 + 1) + 1
<= width (GoB f)
by NAT_1:13;
A216:
0 + 1
<= j2
by A214, NAT_1:13;
A217:
j2 < j2 + 1
by NAT_1:13;
A218:
( 1
<= j2 + 1 &
j2 + 1
< width (GoB f) )
by A214, NAT_1:11;
A219:
( 1
<= j2 &
j2 < width (GoB f) )
by A214, A216, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j2) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 ) }
proof
((GoB f) * (len (GoB f)),j2) `2 < ((GoB f) * (len (GoB f)),(j2 + 1)) `2
by A1, A144, A206, A216, A217, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j2) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 ) }
;
:: thesis: verum
end; then A220:
p in h_strip (GoB f),
j2
by A206, A219, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2 ) }
proof
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
then
(
((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 &
((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2 )
by A148, A206, A215, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A206, A218, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A213, A220, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A211, A212, XBOOLE_0:def 4;
:: thesis: verum end; case A221:
(
j2 + 1
< width (GoB f) &
j2 = 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A222:
(j2 + 1) + 1
<= width (GoB f)
by NAT_1:13;
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * (len (GoB f)),1) `2 }
by A221;
then A223:
p in h_strip (GoB f),
j2
by A206, A221, GOBOARD5:8;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2 ) }
proof
((GoB f) * (len (GoB f)),(j2 + 1)) `2 < ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2
by A148, A150, A206, A222, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= r & r <= ((GoB f) * (len (GoB f)),((j2 + 1) + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A206, A221, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A213, A223, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A211, A212, XBOOLE_0:def 4;
:: thesis: verum end; case A224:
(
j2 + 1
= width (GoB f) &
j2 > 0 )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then
0 + 1
<= j2
by NAT_1:13;
then A225:
( 1
<= j2 &
j2 < width (GoB f) )
by A224, NAT_1:13;
p in { |[s,r]| where s, r is Real : ((GoB f) * (len (GoB f)),(width (GoB f))) `2 <= r }
by A224;
then A226:
p in h_strip (GoB f),
(j2 + 1)
by A206, A224, GOBOARD5:7;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j2) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 ) }
proof
(
((GoB f) * (len (GoB f)),(j2 + 1)) `2 <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 &
((GoB f) * (len (GoB f)),j2) `2 <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 )
by A206, A224, A225, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * (len (GoB f)),j2) `2 <= r & r <= ((GoB f) * (len (GoB f)),(j2 + 1)) `2 ) }
;
:: thesis: verum
end; then
p in h_strip (GoB f),
j2
by A206, A225, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A213, A226, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A211, A212, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A227:
(
p in Cl (Down (Int (cell (GoB f),i2,(j2 + 1))),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) )
by A1, Th3;
A228:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A228, GOBRD11:4;
then A229:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A230:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) is
connected
by A1, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A231:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A232:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A233:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A231, A232, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A234:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A144, A227, A229, A233, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= Component_of p1
by A227, A230, GOBRD11:1;
then A235:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A234, XBOOLE_1:1;
A236:
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) = Int (cell (GoB f),i2,j2)
by A1, Th4;
hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
by A228, A235, A236, XBOOLE_1:1;
:: thesis: verum end; case A237:
(
i2 <> 0 &
i2 <> len (GoB f) & ( for
k being
Element of
NAT holds
( not 1
<= k or not
k + 1
<= len f or not
LSeg (f /. k),
(f /. (k + 1)) = LSeg ((GoB f) * i2,(j2 + 1)),
((GoB f) * (i2 + 1),(j2 + 1)) ) ) )
;
:: thesis: Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)then
0 < i2
;
then A238:
0 + 1
<= i2
by NAT_1:13;
A239:
i2 < len (GoB f)
by A1, A237, XXREAL_0:1;
then A240:
i2 + 1
<= len (GoB f)
by NAT_1:13;
for
k being
Element of
NAT st 1
<= k &
k + 1
<= len f holds
LSeg ((GoB f) * i2,(j2 + 1)),
((GoB f) * (i2 + 1),(j2 + 1)) <> LSeg f,
k
proof
let k be
Element of
NAT ;
:: thesis: ( 1 <= k & k + 1 <= len f implies LSeg ((GoB f) * i2,(j2 + 1)),((GoB f) * (i2 + 1),(j2 + 1)) <> LSeg f,k )
assume A241:
( 1
<= k &
k + 1
<= len f )
;
:: thesis: LSeg ((GoB f) * i2,(j2 + 1)),((GoB f) * (i2 + 1),(j2 + 1)) <> LSeg f,k
then
LSeg f,
k = LSeg (f /. k),
(f /. (k + 1))
by TOPREAL1:def 5;
hence
LSeg ((GoB f) * i2,(j2 + 1)),
((GoB f) * (i2 + 1),(j2 + 1)) <> LSeg f,
k
by A237, A241;
:: thesis: verum
end; then A242:
( 1
<= j2 + 1 &
j2 + 1
<= width (GoB f) & 1
<= i2 &
i2 + 1
<= len (GoB f) implies not
(1 / 2) * (((GoB f) * i2,(j2 + 1)) + ((GoB f) * (i2 + 1),(j2 + 1))) in L~ f )
by GOBOARD7:42;
reconsider p =
(1 / 2) * (((GoB f) * i2,(j2 + 1)) + ((GoB f) * (i2 + 1),(j2 + 1))) as
Point of
(TOP-REAL 2) ;
A243:
p `2 =
(1 / 2) * ((((GoB f) * i2,(j2 + 1)) + ((GoB f) * (i2 + 1),(j2 + 1))) `2 )
by TOPREAL3:9
.=
(1 / 2) * ((((GoB f) * i2,(j2 + 1)) `2 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `2 ))
by TOPREAL3:7
;
A244:
p `1 =
(1 / 2) * ((((GoB f) * i2,(j2 + 1)) + ((GoB f) * (i2 + 1),(j2 + 1))) `1 )
by TOPREAL3:9
.=
(1 / 2) * ((((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 ))
by TOPREAL3:7
;
then A245:
p = |[((1 / 2) * ((((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 ))),((1 / 2) * ((((GoB f) * i2,(j2 + 1)) `2 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `2 )))]|
by A243, EUCLID:57;
A246:
1
< len (GoB f)
by GOBOARD7:34;
A247:
1
<= 1
+ j2
by NAT_1:11;
A248:
1
<= j2 + 1
by NAT_1:11;
A249:
i2 < i2 + 1
by NAT_1:13;
A250:
1
< i2 + 1
by A238, NAT_1:13;
A251:
((GoB f) * i2,(j2 + 1)) `1 < ((GoB f) * (i2 + 1),(j2 + 1)) `1
by A1, A144, A238, A240, A248, A249, GOBOARD5:4;
then A252:
(((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * i2,(j2 + 1)) `1 ) < (((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 )
by XREAL_1:10;
A253:
(((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 ) < (((GoB f) * (i2 + 1),(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 )
by A251, XREAL_1:10;
A254:
((((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * i2,(j2 + 1)) `1 )) / 2
< ((((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 )) / 2
by A252, XREAL_1:76;
A255:
((((GoB f) * i2,(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 )) / 2
< ((((GoB f) * (i2 + 1),(j2 + 1)) `1 ) + (((GoB f) * (i2 + 1),(j2 + 1)) `1 )) / 2
by A253, XREAL_1:76;
A256:
p in {p}
by TARSKI:def 1;
reconsider P =
{p} as
Subset of
(TOP-REAL 2) ;
( ( for
x being
set st
x in P holds
not
x in L~ f ) implies
P misses L~ f )
by XBOOLE_0:3;
then A257:
{p} c= (L~ f) `
by A1, A144, A238, A239, A242, NAT_1:13, SUBSET_1:43, TARSKI:def 1;
then reconsider p1 =
p as
Point of
((TOP-REAL 2) | ((L~ f) ` )) by A256, PRE_TOPC:29;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * i2,(j2 + 1)) `1 <= s & s <= ((GoB f) * (i2 + 1),(j2 + 1)) `1 ) }
then A258:
p in v_strip (GoB f),
i2
by A1, A144, A238, A239, A247, GOBOARD5:9;
A259:
(
j2 = 0 or
j2 >= 0 + 1 )
by NAT_1:13;
now per cases
( ( j2 >= 1 & j2 + 1 < width (GoB f) ) or ( j2 >= 1 & j2 + 1 = width (GoB f) ) or ( j2 = 0 & j2 + 1 < width (GoB f) ) or ( j2 = 0 & j2 + 1 = width (GoB f) ) )
by A1, A144, A259, XXREAL_0:1;
case A260:
(
j2 >= 1 &
j2 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )then A261:
( 1
<= j2 &
j2 < width (GoB f) )
by NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
proof
A262:
j2 < j2 + 1
by NAT_1:13;
A263:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
A264:
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
((GoB f) * 1,j2) `2 < ((GoB f) * 1,(j2 + 1)) `2
by A246, A260, A262, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
by A245, A263, A264;
:: thesis: verum
end; then A265:
p in h_strip (GoB f),
j2
by A246, A261, GOBOARD5:6;
A266:
(j2 + 1) + 1
<= width (GoB f)
by A260, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
proof
A267:
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
A268:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
A269:
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
((GoB f) * 1,(j2 + 1)) `2 < ((GoB f) * 1,((j2 + 1) + 1)) `2
by A246, A248, A266, A267, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
by A245, A268, A269;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A246, A247, A260, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A258, A265, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A256, A257, XBOOLE_0:def 4;
:: thesis: verum end; case A270:
(
j2 >= 1 &
j2 + 1
= width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )A271:
j2 < j2 + 1
by NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
proof
A272:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
A273:
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
((GoB f) * 1,j2) `2 < ((GoB f) * 1,(j2 + 1)) `2
by A246, A270, A271, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,j2) `2 <= r & r <= ((GoB f) * 1,(j2 + 1)) `2 ) }
by A245, A272, A273;
:: thesis: verum
end; then A274:
p in h_strip (GoB f),
j2
by A246, A270, A271, GOBOARD5:6;
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j2 + 1)) `2 <= r }
proof
A275:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
hence
p in { |[s,r]| where s, r is Real : ((GoB f) * 1,(j2 + 1)) `2 <= r }
by A245, A275;
:: thesis: verum
end; then
p in h_strip (GoB f),
(j2 + 1)
by A246, A270, GOBOARD5:7;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A258, A274, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A256, A257, XBOOLE_0:def 4;
:: thesis: verum end; case A276:
(
j2 = 0 &
j2 + 1
< width (GoB f) )
;
:: thesis: ( p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) & p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
proof
A277:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
hence
p in { |[s,r]| where s, r is Real : r <= ((GoB f) * 1,1) `2 }
by A245, A276, A277;
:: thesis: verum
end; then A278:
p in h_strip (GoB f),
j2
by A246, A276, GOBOARD5:8;
A279:
(j2 + 1) + 1
<= width (GoB f)
by A276, NAT_1:13;
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
proof
A280:
j2 + 1
< (j2 + 1) + 1
by NAT_1:13;
A281:
((GoB f) * i2,(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A238, A248, GOBOARD5:2;
A282:
((GoB f) * (i2 + 1),(j2 + 1)) `2 = ((GoB f) * 1,(j2 + 1)) `2
by A1, A144, A240, A248, A250, GOBOARD5:2;
((GoB f) * 1,(j2 + 1)) `2 < ((GoB f) * 1,((j2 + 1) + 1)) `2
by A246, A248, A279, A280, GOBOARD5:5;
hence
p in { |[s,r]| where s, r is Real : ( ((GoB f) * 1,(j2 + 1)) `2 <= r & r <= ((GoB f) * 1,((j2 + 1) + 1)) `2 ) }
by A245, A281, A282;
:: thesis: verum
end; then
p in h_strip (GoB f),
j1
by A144, A246, A276, GOBOARD5:6;
then
(
p in (h_strip (GoB f),j2) /\ (v_strip (GoB f),i2) &
p in (h_strip (GoB f),(j2 + 1)) /\ (v_strip (GoB f),i2) )
by A144, A258, A278, XBOOLE_0:def 4;
then
(
p in cell (GoB f),
i2,
j2 &
p in cell (GoB f),
i2,
(j2 + 1) )
by GOBOARD5:def 3;
hence
(
p in (cell (GoB f),i2,(j2 + 1)) /\ ((L~ f) ` ) &
p in (cell (GoB f),i2,j2) /\ ((L~ f) ` ) )
by A256, A257, XBOOLE_0:def 4;
:: thesis: verum end; end; end; then A283:
(
p in Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) &
p in Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) )
by A1, A144, Th3;
A284:
(
Down (LeftComp f),
((L~ f) ` ) = LeftComp f &
Down (RightComp f),
((L~ f) ` ) = RightComp f )
by Th6;
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= (LeftComp f) \/ (RightComp f)
by A1, A2, Th4;
then
Down (Int (cell (GoB f),i2,j1)),
((L~ f) ` ) c= Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by A284, GOBRD11:4;
then A285:
Cl (Down (Int (cell (GoB f),i2,j1)),((L~ f) ` )) c= Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` ))
by PRE_TOPC:49;
A286:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) is
connected
by A1, Th4;
Down (LeftComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm3;
then
Down (LeftComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A287:
Cl (Down (LeftComp f),((L~ f) ` )) = Down (LeftComp f),
((L~ f) ` )
by PRE_TOPC:52;
Down (RightComp f),
((L~ f) ` ) is_a_component_of (TOP-REAL 2) | ((L~ f) ` )
by Lm4;
then
Down (RightComp f),
((L~ f) ` ) is
closed
by CONNSP_1:35;
then A288:
Cl (Down (RightComp f),((L~ f) ` )) = Down (RightComp f),
((L~ f) ` )
by PRE_TOPC:52;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) = Down ((LeftComp f) \/ (RightComp f)),
((L~ f) ` )
by GOBRD11:4;
then A289:
Cl (Down ((LeftComp f) \/ (RightComp f)),((L~ f) ` )) = (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A287, A288, PRE_TOPC:50;
(Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` )) is
a_union_of_components of
(TOP-REAL 2) | ((L~ f) ` )
by Th6;
then A290:
Component_of p1 c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A283, A285, A289, CONNSP_3:21;
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= Component_of p1
by A283, A286, GOBRD11:1;
then A291:
Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` )) c= (Down (LeftComp f),((L~ f) ` )) \/ (Down (RightComp f),((L~ f) ` ))
by A290, XBOOLE_1:1;
A292:
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) c= Cl (Down (Int (cell (GoB f),i2,j2)),((L~ f) ` ))
by PRE_TOPC:48;
Down (Int (cell (GoB f),i2,j2)),
((L~ f) ` ) = Int (cell (GoB f),i2,j2)
by A1, Th4;
hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
by A284, A291, A292, XBOOLE_1:1;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: verum end; end; end; hence
Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f)
;
:: thesis: verum end;
hence
( not Int (cell (GoB f),i1,j1) c= (LeftComp f) \/ (RightComp f) or Int (cell (GoB f),i2,j2) c= (LeftComp f) \/ (RightComp f) )
; :: thesis: verum