let n be Element of NAT ; :: thesis: for C being Simple_closed_curve
for i1, i2, j, k being Element of NAT st 1 < i1 & i1 <= i2 & i2 < len (Gauge C,n) & 1 <= j & j <= k & k <= width (Gauge C,n) & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Upper_Seq C,n)) = {((Gauge C,n) * i2,k)} & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Lower_Seq C,n)) = {((Gauge C,n) * i1,j)} holds
(LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) meets Upper_Arc C
let C be Simple_closed_curve; :: thesis: for i1, i2, j, k being Element of NAT st 1 < i1 & i1 <= i2 & i2 < len (Gauge C,n) & 1 <= j & j <= k & k <= width (Gauge C,n) & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Upper_Seq C,n)) = {((Gauge C,n) * i2,k)} & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Lower_Seq C,n)) = {((Gauge C,n) * i1,j)} holds
(LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) meets Upper_Arc C
let i1, i2, j, k be Element of NAT ; :: thesis: ( 1 < i1 & i1 <= i2 & i2 < len (Gauge C,n) & 1 <= j & j <= k & k <= width (Gauge C,n) & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Upper_Seq C,n)) = {((Gauge C,n) * i2,k)} & ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Lower_Seq C,n)) = {((Gauge C,n) * i1,j)} implies (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) meets Upper_Arc C )
set G = Gauge C,n;
set pio = LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k);
set poz = LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k);
set US = Upper_Seq C,n;
set LS = Lower_Seq C,n;
assume that
A1: 1 < i1 and
A2: i1 <= i2 and
A3: i2 < len (Gauge C,n) and
A4: 1 <= j and
A5: j <= k and
A6: k <= width (Gauge C,n) and
A7: ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Upper_Seq C,n)) = {((Gauge C,n) * i2,k)} and
A8: ((LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))) /\ (L~ (Lower_Seq C,n)) = {((Gauge C,n) * i1,j)} and
A9: (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) misses Upper_Arc C ; :: thesis: contradiction
set Gij = (Gauge C,n) * i1,j;
A10: j <= width (Gauge C,n) by A5, A6, XXREAL_0:2;
A11: i1 < len (Gauge C,n) by A2, A3, XXREAL_0:2;
then A12: [i1,j] in Indices (Gauge C,n) by A1, A4, A10, MATRIX_1:37;
set Gi1k = (Gauge C,n) * i1,k;
set Gik = (Gauge C,n) * i2,k;
A13: L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> = (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) \/ (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) by TOPREAL3:23;
len (Gauge C,n) >= 4 by JORDAN8:13;
then A14: len (Gauge C,n) >= 1 by XXREAL_0:2;
then A15: [(len (Gauge C,n)),j] in Indices (Gauge C,n) by A4, A10, MATRIX_1:37;
A16: 1 <= k by A4, A5, XXREAL_0:2;
then A17: [1,k] in Indices (Gauge C,n) by A6, A14, MATRIX_1:37;
A18: 1 < i2 by A1, A2, XXREAL_0:2;
then A19: [i2,k] in Indices (Gauge C,n) by A3, A6, A16, MATRIX_1:37;
A20: ((Gauge C,n) * i1,k) `2 = ((Gauge C,n) * 1,k) `2 by A1, A6, A11, A16, GOBOARD5:2
.= ((Gauge C,n) * i2,k) `2 by A3, A6, A18, A16, GOBOARD5:2 ;
((Gauge C,n) * i1,k) `1 = ((Gauge C,n) * i1,1) `1 by A1, A6, A11, A16, GOBOARD5:3
.= ((Gauge C,n) * i1,j) `1 by A1, A4, A11, A10, GOBOARD5:3 ;
then A21: (Gauge C,n) * i1,k = |[(((Gauge C,n) * i1,j) `1 ),(((Gauge C,n) * i2,k) `2 )]| by A20, EUCLID:57;
A22: [(len (Gauge C,n)),k] in Indices (Gauge C,n) by A6, A16, A14, MATRIX_1:37;
A23: [i1,j] in Indices (Gauge C,n) by A1, A4, A11, A10, MATRIX_1:37;
set Wbo = W-bound (L~ (Cage C,n));
set Wmin = W-min (L~ (Cage C,n));
A24: len (Gauge C,n) = width (Gauge C,n) by JORDAN8:def 1;
set Ebo = E-bound (L~ (Cage C,n));
set Emax = E-max (L~ (Cage C,n));
A25: len (Lower_Seq C,n) >= 1 + 2 by JORDAN1E:19;
then A26: len (Lower_Seq C,n) >= 1 by XXREAL_0:2;
then A27: 1 in dom (Lower_Seq C,n) by FINSEQ_3:27;
then A28: (Lower_Seq C,n) . 1 = (Lower_Seq C,n) /. 1 by PARTFUN1:def 8
.= E-max (L~ (Cage C,n)) by JORDAN1F:6 ;
len (Lower_Seq C,n) in dom (Lower_Seq C,n) by A26, FINSEQ_3:27;
then A29: (Lower_Seq C,n) . (len (Lower_Seq C,n)) = (Lower_Seq C,n) /. (len (Lower_Seq C,n)) by PARTFUN1:def 8
.= W-min (L~ (Cage C,n)) by JORDAN1F:8 ;
set do = L_Cut (Lower_Seq C,n),((Gauge C,n) * i1,j);
(Gauge C,n) * i1,j in {((Gauge C,n) * i1,j)} by TARSKI:def 1;
then A30: (Gauge C,n) * i1,j in L~ (Lower_Seq C,n) by A8, XBOOLE_0:def 4;
(W-min (L~ (Cage C,n))) `1 = W-bound (L~ (Cage C,n)) by EUCLID:56
.= ((Gauge C,n) * 1,k) `1 by A6, A16, A24, JORDAN1A:94 ;
then A31: (Gauge C,n) * i1,j <> (Lower_Seq C,n) . (len (Lower_Seq C,n)) by A1, A17, A29, A12, JORDAN1G:7;
then reconsider do = L_Cut (Lower_Seq C,n),((Gauge C,n) * i1,j) as being_S-Seq FinSequence of (TOP-REAL 2) by A30, JORDAN3:69;
A32: (Gauge C,n) * i1,j in rng (Lower_Seq C,n) by A1, A4, A11, A30, A10, JORDAN1G:5, JORDAN1J:40;
then A33: do is_sequence_on Gauge C,n by JORDAN1G:5, JORDAN1J:39;
(E-max (L~ (Cage C,n))) `1 = E-bound (L~ (Cage C,n)) by EUCLID:56
.= ((Gauge C,n) * (len (Gauge C,n)),k) `1 by A6, A16, A24, JORDAN1A:92 ;
then A34: (Gauge C,n) * i1,j <> (Lower_Seq C,n) . 1 by A2, A3, A12, A22, A28, JORDAN1G:7;
A35: len do >= 1 + 1 by TOPREAL1:def 10;
then reconsider do = do as non constant being_S-Seq s.c.c. FinSequence of (TOP-REAL 2) by A33, JGRAPH_1:16, JORDAN8:8;
A36: L~ do c= L~ (Lower_Seq C,n) by A30, JORDAN3:77;
A37: [1,j] in Indices (Gauge C,n) by A4, A10, A14, MATRIX_1:37;
A38: now
assume ((Gauge C,n) * i1,j) `1 = W-bound (L~ (Cage C,n)) ; :: thesis: contradiction
then ((Gauge C,n) * 1,j) `1 = ((Gauge C,n) * i1,j) `1 by A4, A10, A24, JORDAN1A:94;
hence contradiction by A1, A23, A37, JORDAN1G:7; :: thesis: verum
end;
set pion = <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>;
A39: (Gauge C,n) * i1,k in LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) by RLTOPSP1:69;
set UA = Upper_Arc C;
A40: (Gauge C,n) * i1,k in LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) by RLTOPSP1:69;
set go = R_Cut (Upper_Seq C,n),((Gauge C,n) * i2,k);
A41: len (Upper_Seq C,n) >= 3 by JORDAN1E:19;
then len (Upper_Seq C,n) >= 1 by XXREAL_0:2;
then 1 in dom (Upper_Seq C,n) by FINSEQ_3:27;
then A42: (Upper_Seq C,n) . 1 = (Upper_Seq C,n) /. 1 by PARTFUN1:def 8
.= W-min (L~ (Cage C,n)) by JORDAN1F:5 ;
A43: [i1,k] in Indices (Gauge C,n) by A1, A6, A11, A16, MATRIX_1:37;
A44: now
let n be Element of NAT ; :: thesis: ( n in dom <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> implies ex i, j being Element of NAT st
( [i,j] in Indices (Gauge C,n) & <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. n = (Gauge C,n) * i,j ) )
assume n in dom <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> ; :: thesis: ex i, j being Element of NAT st
( [i,j] in Indices (Gauge C,n) & <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. n = (Gauge C,n) * i,j )
then n in {1,2,3} by FINSEQ_3:1, FINSEQ_3:30;
then ( n = 1 or n = 2 or n = 3 ) by ENUMSET1:def 1;
hence ex i, j being Element of NAT st
( [i,j] in Indices (Gauge C,n) & <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. n = (Gauge C,n) * i,j ) by A23, A19, A43, FINSEQ_4:27; :: thesis: verum
end;
(Gauge C,n) * i2,k in {((Gauge C,n) * i2,k)} by TARSKI:def 1;
then A45: (Gauge C,n) * i2,k in L~ (Upper_Seq C,n) by A7, XBOOLE_0:def 4;
(W-min (L~ (Cage C,n))) `1 = W-bound (L~ (Cage C,n)) by EUCLID:56
.= ((Gauge C,n) * 1,k) `1 by A6, A16, A24, JORDAN1A:94 ;
then A46: (Gauge C,n) * i2,k <> (Upper_Seq C,n) . 1 by A1, A2, A19, A42, A17, JORDAN1G:7;
then reconsider go = R_Cut (Upper_Seq C,n),((Gauge C,n) * i2,k) as being_S-Seq FinSequence of (TOP-REAL 2) by A45, JORDAN3:70;
A47: (Gauge C,n) * i2,k in rng (Upper_Seq C,n) by A3, A6, A18, A45, A16, JORDAN1G:4, JORDAN1J:40;
then A48: go is_sequence_on Gauge C,n by JORDAN1G:4, JORDAN1J:38;
len do >= 1 by A35, XXREAL_0:2;
then 1 in dom do by FINSEQ_3:27;
then A49: do /. 1 = do . 1 by PARTFUN1:def 8
.= (Gauge C,n) * i1,j by A30, JORDAN3:58 ;
then A50: LSeg do,1 = LSeg ((Gauge C,n) * i1,j),(do /. (1 + 1)) by A35, TOPREAL1:def 5;
A51: {((Gauge C,n) * i1,j)} c= (LSeg do,1) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {((Gauge C,n) * i1,j)} or x in (LSeg do,1) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) )
assume x in {((Gauge C,n) * i1,j)} ; :: thesis: x in (LSeg do,1) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>)
then A52: x = (Gauge C,n) * i1,j by TARSKI:def 1;
(Gauge C,n) * i1,j in LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i1,j) by RLTOPSP1:69;
then (Gauge C,n) * i1,j in (LSeg ((Gauge C,n) * i2,k),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)) by XBOOLE_0:def 3;
then A53: (Gauge C,n) * i1,j in L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> by SPRECT_1:10;
(Gauge C,n) * i1,j in LSeg do,1 by A50, RLTOPSP1:69;
hence x in (LSeg do,1) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) by A52, A53, XBOOLE_0:def 4; :: thesis: verum
end;
LSeg do,1 c= L~ do by TOPREAL3:26;
then LSeg do,1 c= L~ (Lower_Seq C,n) by A36, XBOOLE_1:1;
then (LSeg do,1) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) c= {((Gauge C,n) * i1,j)} by A8, A13, XBOOLE_1:26;
then A54: (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) /\ (LSeg do,1) = {((Gauge C,n) * i1,j)} by A51, XBOOLE_0:def 10;
A55: rng do c= L~ do by A35, SPPOL_2:18;
A56: len go >= 1 + 1 by TOPREAL1:def 10;
then reconsider go = go as non constant being_S-Seq s.c.c. FinSequence of (TOP-REAL 2) by A48, JGRAPH_1:16, JORDAN8:8;
A57: L~ go c= L~ (Upper_Seq C,n) by A45, JORDAN3:76;
A58: len go > 1 by A56, NAT_1:13;
then A59: len go in dom go by FINSEQ_3:27;
then A60: go /. (len go) = go . (len go) by PARTFUN1:def 8
.= (Gauge C,n) * i2,k by A45, JORDAN3:59 ;
reconsider m = (len go) - 1 as Element of NAT by A59, FINSEQ_3:28;
A61: m + 1 = len go ;
then A62: (len go) -' 1 = m by NAT_D:34;
m >= 1 by A56, XREAL_1:21;
then A63: LSeg go,m = LSeg (go /. m),((Gauge C,n) * i2,k) by A60, A61, TOPREAL1:def 5;
A64: {((Gauge C,n) * i2,k)} c= (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {((Gauge C,n) * i2,k)} or x in (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) )
assume x in {((Gauge C,n) * i2,k)} ; :: thesis: x in (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>)
then A65: x = (Gauge C,n) * i2,k by TARSKI:def 1;
(Gauge C,n) * i2,k in LSeg ((Gauge C,n) * i2,k),((Gauge C,n) * i1,k) by RLTOPSP1:69;
then (Gauge C,n) * i2,k in (LSeg ((Gauge C,n) * i2,k),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)) by XBOOLE_0:def 3;
then A66: (Gauge C,n) * i2,k in L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> by SPRECT_1:10;
(Gauge C,n) * i2,k in LSeg go,m by A63, RLTOPSP1:69;
hence x in (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) by A65, A66, XBOOLE_0:def 4; :: thesis: verum
end;
LSeg go,m c= L~ go by TOPREAL3:26;
then LSeg go,m c= L~ (Upper_Seq C,n) by A57, XBOOLE_1:1;
then (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) c= {((Gauge C,n) * i2,k)} by A7, A13, XBOOLE_1:26;
then A67: (LSeg go,m) /\ (L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) = {((Gauge C,n) * i2,k)} by A64, XBOOLE_0:def 10;
A68: go /. 1 = (Upper_Seq C,n) /. 1 by A45, SPRECT_3:39
.= W-min (L~ (Cage C,n)) by JORDAN1F:5 ;
A69: (Lower_Seq C,n) . 1 = (Lower_Seq C,n) /. 1 by A27, PARTFUN1:def 8
.= E-max (L~ (Cage C,n)) by JORDAN1F:6 ;
A70: (L~ go) /\ (L~ do) c= {(go /. 1)}
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in (L~ go) /\ (L~ do) or x in {(go /. 1)} )
assume A71: x in (L~ go) /\ (L~ do) ; :: thesis: x in {(go /. 1)}
then A72: x in L~ do by XBOOLE_0:def 4;
A73: now
assume x = E-max (L~ (Cage C,n)) ; :: thesis: contradiction
then A74: E-max (L~ (Cage C,n)) = (Gauge C,n) * i1,j by A30, A69, A72, JORDAN1E:11;
((Gauge C,n) * (len (Gauge C,n)),j) `1 = E-bound (L~ (Cage C,n)) by A4, A10, A24, JORDAN1A:92;
then (E-max (L~ (Cage C,n))) `1 <> E-bound (L~ (Cage C,n)) by A2, A3, A23, A15, A74, JORDAN1G:7;
hence contradiction by EUCLID:56; :: thesis: verum
end;
x in L~ go by A71, XBOOLE_0:def 4;
then x in (L~ (Upper_Seq C,n)) /\ (L~ (Lower_Seq C,n)) by A57, A36, A72, XBOOLE_0:def 4;
then x in {(W-min (L~ (Cage C,n))),(E-max (L~ (Cage C,n)))} by JORDAN1E:20;
then ( x = W-min (L~ (Cage C,n)) or x = E-max (L~ (Cage C,n)) ) by TARSKI:def 2;
hence x in {(go /. 1)} by A68, A73, TARSKI:def 1; :: thesis: verum
end;
set W2 = go /. 2;
A75: 2 in dom go by A56, FINSEQ_3:27;
go = mid (Upper_Seq C,n),1,(((Gauge C,n) * i2,k) .. (Upper_Seq C,n)) by A47, JORDAN1G:57
.= (Upper_Seq C,n) | (((Gauge C,n) * i2,k) .. (Upper_Seq C,n)) by A47, FINSEQ_4:31, FINSEQ_6:122 ;
then A76: go /. 2 = (Upper_Seq C,n) /. 2 by A75, FINSEQ_4:85;
A77: rng go c= L~ go by A56, SPPOL_2:18;
A78: go /. 1 = (Lower_Seq C,n) /. (len (Lower_Seq C,n)) by A68, JORDAN1F:8
.= do /. (len do) by A30, JORDAN1J:35 ;
{(go /. 1)} c= (L~ go) /\ (L~ do)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {(go /. 1)} or x in (L~ go) /\ (L~ do) )
assume x in {(go /. 1)} ; :: thesis: x in (L~ go) /\ (L~ do)
then A79: x = go /. 1 by TARSKI:def 1;
then A80: x in rng go by FINSEQ_6:46;
x in rng do by A78, A79, REVROT_1:3;
hence x in (L~ go) /\ (L~ do) by A77, A55, A80, XBOOLE_0:def 4; :: thesis: verum
end;
then A81: (L~ go) /\ (L~ do) = {(go /. 1)} by A70, XBOOLE_0:def 10;
now
per cases ( ( ((Gauge C,n) * i1,j) `1 <> ((Gauge C,n) * i2,k) `1 & ((Gauge C,n) * i1,j) `2 <> ((Gauge C,n) * i2,k) `2 ) or ((Gauge C,n) * i1,j) `1 = ((Gauge C,n) * i2,k) `1 or ((Gauge C,n) * i1,j) `2 = ((Gauge C,n) * i2,k) `2 ) ;
suppose ( ((Gauge C,n) * i1,j) `1 <> ((Gauge C,n) * i2,k) `1 & ((Gauge C,n) * i1,j) `2 <> ((Gauge C,n) * i2,k) `2 ) ; :: thesis: contradiction
then <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> is being_S-Seq by A21, TOPREAL3:42;
then consider pion1 being FinSequence of (TOP-REAL 2) such that
A82: pion1 is_sequence_on Gauge C,n and
A83: pion1 is being_S-Seq and
A84: L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> = L~ pion1 and
A85: <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. 1 = pion1 /. 1 and
A86: <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. (len <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) = pion1 /. (len pion1) and
A87: len <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> <= len pion1 by A44, GOBOARD3:2;
reconsider pion1 = pion1 as being_S-Seq FinSequence of (TOP-REAL 2) by A83;
A88: (go ^' pion1) /. (len (go ^' pion1)) = <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. (len <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) by A86, GRAPH_2:58
.= <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. 3 by FINSEQ_1:62
.= do /. 1 by A49, FINSEQ_4:27 ;
A89: go /. (len go) = pion1 /. 1 by A60, A85, FINSEQ_4:27;
A90: (L~ go) /\ (L~ pion1) c= {(pion1 /. 1)}
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in (L~ go) /\ (L~ pion1) or x in {(pion1 /. 1)} )
assume A91: x in (L~ go) /\ (L~ pion1) ; :: thesis: x in {(pion1 /. 1)}
then A92: x in L~ pion1 by XBOOLE_0:def 4;
x in L~ go by A91, XBOOLE_0:def 4;
hence x in {(pion1 /. 1)} by A7, A13, A60, A57, A84, A89, A92, XBOOLE_0:def 4; :: thesis: verum
end;
len pion1 >= 2 + 1 by A87, FINSEQ_1:62;
then A93: len pion1 > 1 + 1 by NAT_1:13;
then A94: rng pion1 c= L~ pion1 by SPPOL_2:18;
{(pion1 /. 1)} c= (L~ go) /\ (L~ pion1)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {(pion1 /. 1)} or x in (L~ go) /\ (L~ pion1) )
assume x in {(pion1 /. 1)} ; :: thesis: x in (L~ go) /\ (L~ pion1)
then A95: x = pion1 /. 1 by TARSKI:def 1;
then A96: x in rng pion1 by FINSEQ_6:46;
x in rng go by A89, A95, REVROT_1:3;
hence x in (L~ go) /\ (L~ pion1) by A77, A94, A96, XBOOLE_0:def 4; :: thesis: verum
end;
then A97: (L~ go) /\ (L~ pion1) = {(pion1 /. 1)} by A90, XBOOLE_0:def 10;
then A98: go ^' pion1 is s.n.c. by A89, JORDAN1J:54;
A99: <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. (len <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*>) = <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. 3 by FINSEQ_1:62
.= do /. 1 by A49, FINSEQ_4:27 ;
A100: {(pion1 /. (len pion1))} c= (L~ do) /\ (L~ pion1)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {(pion1 /. (len pion1))} or x in (L~ do) /\ (L~ pion1) )
assume x in {(pion1 /. (len pion1))} ; :: thesis: x in (L~ do) /\ (L~ pion1)
then A101: x = pion1 /. (len pion1) by TARSKI:def 1;
then A102: x in rng pion1 by REVROT_1:3;
x in rng do by A86, A99, A101, FINSEQ_6:46;
hence x in (L~ do) /\ (L~ pion1) by A55, A94, A102, XBOOLE_0:def 4; :: thesis: verum
end;
(L~ do) /\ (L~ pion1) c= {(pion1 /. (len pion1))}
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in (L~ do) /\ (L~ pion1) or x in {(pion1 /. (len pion1))} )
assume A103: x in (L~ do) /\ (L~ pion1) ; :: thesis: x in {(pion1 /. (len pion1))}
then A104: x in L~ pion1 by XBOOLE_0:def 4;
x in L~ do by A103, XBOOLE_0:def 4;
hence x in {(pion1 /. (len pion1))} by A8, A13, A49, A36, A84, A86, A99, A104, XBOOLE_0:def 4; :: thesis: verum
end;
then A105: (L~ do) /\ (L~ pion1) = {(pion1 /. (len pion1))} by A100, XBOOLE_0:def 10;
A106: (L~ (go ^' pion1)) /\ (L~ do) = ((L~ go) \/ (L~ pion1)) /\ (L~ do) by A89, TOPREAL8:35
.= {(go /. 1)} \/ {(do /. 1)} by A81, A86, A99, A105, XBOOLE_1:23
.= {((go ^' pion1) /. 1)} \/ {(do /. 1)} by GRAPH_2:57
.= {((go ^' pion1) /. 1),(do /. 1)} by ENUMSET1:41 ;
A107: Upper_Arc C is_an_arc_of W-min C, E-max C by JORDAN6:def 8;
then A108: Upper_Arc C is connected by JORDAN6:11;
set godo = (go ^' pion1) ^' do;
A109: do /. (len do) = (go ^' pion1) /. 1 by A78, GRAPH_2:57;
A110: go ^' pion1 is_sequence_on Gauge C,n by A48, A82, A89, TOPREAL8:12;
then A111: (go ^' pion1) ^' do is_sequence_on Gauge C,n by A33, A88, TOPREAL8:12;
A112: (len pion1) - 1 >= 1 by A93, XREAL_1:21;
then A113: (len pion1) -' 1 = (len pion1) - 1 by XREAL_0:def 2;
A114: {((Gauge C,n) * i1,j)} c= (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {((Gauge C,n) * i1,j)} or x in (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1) )
assume x in {((Gauge C,n) * i1,j)} ; :: thesis: x in (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1)
then A115: x = (Gauge C,n) * i1,j by TARSKI:def 1;
pion1 /. (((len pion1) -' 1) + 1) = <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> /. 3 by A86, A113, FINSEQ_1:62
.= (Gauge C,n) * i1,j by FINSEQ_4:27 ;
then A116: (Gauge C,n) * i1,j in LSeg pion1,((len pion1) -' 1) by A112, A113, TOPREAL1:27;
(Gauge C,n) * i1,j in LSeg do,1 by A50, RLTOPSP1:69;
hence x in (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1) by A115, A116, XBOOLE_0:def 4; :: thesis: verum
end;
LSeg pion1,((len pion1) -' 1) c= L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> by A84, TOPREAL3:26;
then (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1) c= {((Gauge C,n) * i1,j)} by A54, XBOOLE_1:27;
then A117: (LSeg pion1,((len pion1) -' 1)) /\ (LSeg do,1) = {((Gauge C,n) * i1,j)} by A114, XBOOLE_0:def 10;
((len pion1) - 1) + 1 <= len pion1 ;
then A118: (len pion1) -' 1 < len pion1 by A113, NAT_1:13;
len pion1 >= 2 + 1 by A87, FINSEQ_1:62;
then A119: (len pion1) - 2 >= 0 by XREAL_1:21;
then ((len pion1) -' 2) + 1 = ((len pion1) - 2) + 1 by XREAL_0:def 2
.= (len pion1) -' 1 by A112, XREAL_0:def 2 ;
then A120: (LSeg (go ^' pion1),((len go) + ((len pion1) -' 2))) /\ (LSeg do,1) = {((go ^' pion1) /. (len (go ^' pion1)))} by A49, A89, A88, A118, A117, TOPREAL8:31;
(rng go) /\ (rng pion1) c= {(pion1 /. 1)} by A77, A94, A97, XBOOLE_1:27;
then A121: go ^' pion1 is one-to-one by JORDAN1J:55;
((len (go ^' pion1)) + 1) - 1 = ((len go) + (len pion1)) - 1 by GRAPH_2:13;
then (len (go ^' pion1)) - 1 = (len go) + ((len pion1) - 2)
.= (len go) + ((len pion1) -' 2) by A119, XREAL_0:def 2 ;
then A122: (len (go ^' pion1)) -' 1 = (len go) + ((len pion1) -' 2) by XREAL_0:def 2;
A123: L~ (Cage C,n) = (L~ (Upper_Seq C,n)) \/ (L~ (Lower_Seq C,n)) by JORDAN1E:17;
then A124: L~ (Upper_Seq C,n) c= L~ (Cage C,n) by XBOOLE_1:7;
then A125: L~ go c= L~ (Cage C,n) by A57, XBOOLE_1:1;
A126: {((Gauge C,n) * i2,k)} c= (LSeg go,m) /\ (LSeg pion1,1)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in {((Gauge C,n) * i2,k)} or x in (LSeg go,m) /\ (LSeg pion1,1) )
assume x in {((Gauge C,n) * i2,k)} ; :: thesis: x in (LSeg go,m) /\ (LSeg pion1,1)
then A127: x = (Gauge C,n) * i2,k by TARSKI:def 1;
A128: (Gauge C,n) * i2,k in LSeg go,m by A63, RLTOPSP1:69;
(Gauge C,n) * i2,k in LSeg pion1,1 by A60, A89, A93, TOPREAL1:27;
hence x in (LSeg go,m) /\ (LSeg pion1,1) by A127, A128, XBOOLE_0:def 4; :: thesis: verum
end;
LSeg pion1,1 c= L~ <*((Gauge C,n) * i2,k),((Gauge C,n) * i1,k),((Gauge C,n) * i1,j)*> by A84, TOPREAL3:26;
then (LSeg go,((len go) -' 1)) /\ (LSeg pion1,1) c= {((Gauge C,n) * i2,k)} by A62, A67, XBOOLE_1:27;
then (LSeg go,((len go) -' 1)) /\ (LSeg pion1,1) = {(go /. (len go))} by A60, A62, A126, XBOOLE_0:def 10;
then A129: go ^' pion1 is unfolded by A89, TOPREAL8:34;
len (go ^' pion1) >= len go by TOPREAL8:7;
then A130: len (go ^' pion1) >= 1 + 1 by A56, XXREAL_0:2;
then A131: len (go ^' pion1) > 1 + 0 by NAT_1:13;
A132: now
assume A133: ((Gauge C,n) * i2,k) .. (Upper_Seq C,n) <= 1 ; :: thesis: contradiction
((Gauge C,n) * i2,k) .. (Upper_Seq C,n) >= 1 by A47, FINSEQ_4:31;
then ((Gauge C,n) * i2,k) .. (Upper_Seq C,n) = 1 by A133, XXREAL_0:1;
then (Gauge C,n) * i2,k = (Upper_Seq C,n) /. 1 by A47, FINSEQ_5:41;
hence contradiction by A42, A46, JORDAN1F:5; :: thesis: verum
end;
A134: Upper_Seq C,n is_sequence_on Gauge C,n by JORDAN1G:4;
A135: (W-min (L~ (Cage C,n))) `1 = W-bound (L~ (Cage C,n)) by EUCLID:56;
set ff = Rotate (Cage C,n),(W-min (L~ (Cage C,n)));
A136: 1 + 1 <= len (Cage C,n) by GOBOARD7:36, XXREAL_0:2;
A137: len ((go ^' pion1) ^' do) >= len (go ^' pion1) by TOPREAL8:7;
then A138: 1 + 1 <= len ((go ^' pion1) ^' do) by A130, XXREAL_0:2;
not go ^' pion1 is trivial by A130, REALSET1:13;
then reconsider godo = (go ^' pion1) ^' do as non constant standard special_circular_sequence by A138, A88, A111, A129, A122, A120, A98, A121, A106, A109, JORDAN8:7, JORDAN8:8, TOPREAL8:11, TOPREAL8:33, TOPREAL8:34;
A139: L~ godo = (L~ (go ^' pion1)) \/ (L~ do) by A88, TOPREAL8:35
.= ((L~ go) \/ (L~ pion1)) \/ (L~ do) by A89, TOPREAL8:35 ;
A140: (right_cell godo,1,(Gauge C,n)) \ (L~ godo) c= RightComp godo by A138, A111, JORDAN9:29;
2 in dom godo by A138, FINSEQ_3:27;
then A141: godo /. 2 in rng godo by PARTFUN2:4;
A142: W-min C in Upper_Arc C by A107, TOPREAL1:4;
W-min (L~ (Cage C,n)) in rng (Cage C,n) by SPRECT_2:47;
then A143: (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) /. 1 = W-min (L~ (Cage C,n)) by FINSEQ_6:98;
A144: L~ (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) = L~ (Cage C,n) by REVROT_1:33;
then (W-max (L~ (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))))) .. (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) > 1 by A143, SPRECT_5:23;
then (N-min (L~ (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))))) .. (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) > 1 by A143, A144, SPRECT_5:24, XXREAL_0:2;
then (N-max (L~ (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))))) .. (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) > 1 by A143, A144, SPRECT_5:25, XXREAL_0:2;
then A145: (E-max (L~ (Cage C,n))) .. (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) > 1 by A143, A144, SPRECT_5:26, XXREAL_0:2;
A146: Cage C,n is_sequence_on Gauge C,n by JORDAN9:def 1;
then A147: Rotate (Cage C,n),(W-min (L~ (Cage C,n))) is_sequence_on Gauge C,n by REVROT_1:34;
A148: ((Gauge C,n) * i1,k) `1 = ((Gauge C,n) * i1,1) `1 by A1, A6, A11, A16, GOBOARD5:3
.= ((Gauge C,n) * i1,j) `1 by A1, A4, A11, A10, GOBOARD5:3 ;
then A149: W-bound (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) = ((Gauge C,n) * i1,j) `1 by SPRECT_1:62;
A150: L~ (Lower_Seq C,n) c= L~ (Cage C,n) by A123, XBOOLE_1:7;
then A151: L~ do c= L~ (Cage C,n) by A36, XBOOLE_1:1;
A152: W-min C in C by SPRECT_1:15;
A153: now
assume W-min C in L~ godo ; :: thesis: contradiction
then A154: ( W-min C in (L~ go) \/ (L~ pion1) or W-min C in L~ do ) by A139, XBOOLE_0:def 3;
end;
A155: len (Upper_Seq C,n) >= 2 by A41, XXREAL_0:2;
A156: (L~ go) \/ (L~ do) is compact by COMPTS_1:19;
1 + 1 <= len (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) by GOBOARD7:36, XXREAL_0:2;
then right_cell (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))),1 = right_cell (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))),1,(GoB (Rotate (Cage C,n),(W-min (L~ (Cage C,n))))) by JORDAN1H:29
.= right_cell (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))),1,(GoB (Cage C,n)) by REVROT_1:28
.= right_cell (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))),1,(Gauge C,n) by JORDAN1H:52
.= right_cell ((Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) -: (E-max (L~ (Cage C,n)))),1,(Gauge C,n) by A145, A147, JORDAN1J:53
.= right_cell (Upper_Seq C,n),1,(Gauge C,n) by JORDAN1E:def 1
.= right_cell (R_Cut (Upper_Seq C,n),((Gauge C,n) * i2,k)),1,(Gauge C,n) by A47, A134, A132, JORDAN1J:52
.= right_cell (go ^' pion1),1,(Gauge C,n) by A58, A110, JORDAN1J:51
.= right_cell godo,1,(Gauge C,n) by A131, A111, JORDAN1J:51 ;
then W-min C in right_cell godo,1,(Gauge C,n) by JORDAN1I:8;
then A157: W-min C in (right_cell godo,1,(Gauge C,n)) \ (L~ godo) by A153, XBOOLE_0:def 5;
A158: rng godo c= L~ godo by A130, A137, SPPOL_2:18, XXREAL_0:2;
A159: godo /. 1 = (go ^' pion1) /. 1 by GRAPH_2:57
.= W-min (L~ (Cage C,n)) by A68, GRAPH_2:57 ;
A160: ((Gauge C,n) * i1,k) `1 <= ((Gauge C,n) * i2,k) `1 by A1, A2, A3, A6, A16, JORDAN1A:39;
then A161: W-bound (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) = ((Gauge C,n) * i1,k) `1 by SPRECT_1:62;
W-bound ((LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) \/ (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k))) = min (W-bound (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k))),(W-bound (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k))) by SPRECT_1:54
.= ((Gauge C,n) * i1,j) `1 by A148, A161, A149 ;
then A162: W-bound (L~ pion1) = ((Gauge C,n) * i1,j) `1 by A84, TOPREAL3:23;
A163: Upper_Arc C c= C by JORDAN6:76;
((Gauge C,n) * i1,j) `1 >= W-bound (L~ (Cage C,n)) by A30, A150, PSCOMP_1:71;
then A164: ((Gauge C,n) * i1,j) `1 > W-bound (L~ (Cage C,n)) by A38, XXREAL_0:1;
A165: E-max C in Upper_Arc C by A107, TOPREAL1:4;
W-min (L~ (Cage C,n)) in rng go by A68, FINSEQ_6:46;
then W-min (L~ (Cage C,n)) in (L~ go) \/ (L~ do) by A77, XBOOLE_0:def 3;
then A166: W-min ((L~ go) \/ (L~ do)) = W-min (L~ (Cage C,n)) by A125, A151, A156, JORDAN1J:21, XBOOLE_1:8;
(W-min ((L~ go) \/ (L~ do))) `1 = W-bound ((L~ go) \/ (L~ do)) by EUCLID:56;
then W-min (((L~ go) \/ (L~ do)) \/ (L~ pion1)) = W-min ((L~ go) \/ (L~ do)) by A162, A156, A166, A135, A164, JORDAN1J:33;
then A167: W-min (L~ godo) = W-min (L~ (Cage C,n)) by A139, A166, XBOOLE_1:4;
godo /. 2 = (go ^' pion1) /. 2 by A130, GRAPH_2:61
.= (Upper_Seq C,n) /. 2 by A56, A76, GRAPH_2:61
.= ((Upper_Seq C,n) ^' (Lower_Seq C,n)) /. 2 by A155, GRAPH_2:61
.= (Rotate (Cage C,n),(W-min (L~ (Cage C,n)))) /. 2 by JORDAN1E:15 ;
then godo /. 2 in W-most (L~ (Cage C,n)) by JORDAN1I:27;
then (godo /. 2) `1 = (W-min (L~ godo)) `1 by A167, PSCOMP_1:88
.= W-bound (L~ godo) by EUCLID:56 ;
then godo /. 2 in W-most (L~ godo) by A158, A141, SPRECT_2:16;
then (Rotate godo,(W-min (L~ godo))) /. 2 in W-most (L~ godo) by A159, A167, FINSEQ_6:95;
then reconsider godo = godo as non constant standard clockwise_oriented special_circular_sequence by JORDAN1I:27;
len (Upper_Seq C,n) in dom (Upper_Seq C,n) by FINSEQ_5:6;
then A168: (Upper_Seq C,n) . (len (Upper_Seq C,n)) = (Upper_Seq C,n) /. (len (Upper_Seq C,n)) by PARTFUN1:def 8
.= E-max (L~ (Cage C,n)) by JORDAN1F:7 ;
A169: east_halfline (E-max C) misses L~ go
proof
assume east_halfline (E-max C) meets L~ go ; :: thesis: contradiction
then consider p being set such that
A170: p in east_halfline (E-max C) and
A171: p in L~ go by XBOOLE_0:3;
reconsider p = p as Point of (TOP-REAL 2) by A170;
p in L~ (Upper_Seq C,n) by A57, A171;
then p in (east_halfline (E-max C)) /\ (L~ (Cage C,n)) by A124, A170, XBOOLE_0:def 4;
then A172: p `1 = E-bound (L~ (Cage C,n)) by JORDAN1A:104, PSCOMP_1:111;
then A173: p = E-max (L~ (Cage C,n)) by A57, A171, JORDAN1J:46;
then E-max (L~ (Cage C,n)) = (Gauge C,n) * i2,k by A45, A168, A171, JORDAN1J:43;
then ((Gauge C,n) * i2,k) `1 = ((Gauge C,n) * (len (Gauge C,n)),k) `1 by A6, A16, A24, A172, A173, JORDAN1A:92;
hence contradiction by A3, A19, A22, JORDAN1G:7; :: thesis: verum
end;
now
assume east_halfline (E-max C) meets L~ godo ; :: thesis: contradiction
then A174: ( east_halfline (E-max C) meets (L~ go) \/ (L~ pion1) or east_halfline (E-max C) meets L~ do ) by A139, XBOOLE_1:70;
per cases ( east_halfline (E-max C) meets L~ go or east_halfline (E-max C) meets L~ pion1 or east_halfline (E-max C) meets L~ do ) by A174, XBOOLE_1:70;
suppose east_halfline (E-max C) meets L~ pion1 ; :: thesis: contradiction
then consider p being set such that
A175: p in east_halfline (E-max C) and
A176: p in L~ pion1 by XBOOLE_0:3;
reconsider p = p as Point of (TOP-REAL 2) by A175;
A177: p `2 = (E-max C) `2 by A175, TOPREAL1:def 13;
A178: now
per cases ( p in LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) or p in LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) ) by A13, A84, A176, XBOOLE_0:def 3;
suppose p in LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) ; :: thesis: p `1 <= ((Gauge C,n) * i2,k) `1
hence p `1 <= ((Gauge C,n) * i2,k) `1 by A160, TOPREAL1:9; :: thesis: verum
end;
suppose p in LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) ; :: thesis: p `1 <= ((Gauge C,n) * i2,k) `1
hence p `1 <= ((Gauge C,n) * i2,k) `1 by A148, A160, GOBOARD7:5; :: thesis: verum
end;
end;
end;
i2 + 1 <= len (Gauge C,n) by A3, NAT_1:13;
then (i2 + 1) - 1 <= (len (Gauge C,n)) - 1 by XREAL_1:11;
then A179: i2 <= (len (Gauge C,n)) -' 1 by XREAL_0:def 2;
(len (Gauge C,n)) -' 1 <= len (Gauge C,n) by NAT_D:35;
then ((Gauge C,n) * i2,k) `1 <= ((Gauge C,n) * ((len (Gauge C,n)) -' 1),1) `1 by A6, A18, A16, A24, A14, A179, JORDAN1A:39;
then p `1 <= ((Gauge C,n) * ((len (Gauge C,n)) -' 1),1) `1 by A178, XXREAL_0:2;
then p `1 <= E-bound C by A14, JORDAN8:15;
then A180: p `1 <= (E-max C) `1 by EUCLID:56;
p `1 >= (E-max C) `1 by A175, TOPREAL1:def 13;
then p `1 = (E-max C) `1 by A180, XXREAL_0:1;
then p = E-max C by A177, TOPREAL3:11;
hence contradiction by A9, A13, A84, A165, A176, XBOOLE_0:3; :: thesis: verum
end;
suppose east_halfline (E-max C) meets L~ do ; :: thesis: contradiction
then consider p being set such that
A181: p in east_halfline (E-max C) and
A182: p in L~ do by XBOOLE_0:3;
reconsider p = p as Point of (TOP-REAL 2) by A181;
A183: p in LSeg do,(Index p,do) by A182, JORDAN3:42;
consider t being Nat such that
A184: t in dom (Lower_Seq C,n) and
A185: (Lower_Seq C,n) . t = (Gauge C,n) * i1,j by A32, FINSEQ_2:11;
1 <= t by A184, FINSEQ_3:27;
then A186: 1 < t by A34, A185, XXREAL_0:1;
t <= len (Lower_Seq C,n) by A184, FINSEQ_3:27;
then (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) + 1 = t by A185, A186, JORDAN3:45;
then A187: len (L_Cut (Lower_Seq C,n),((Gauge C,n) * i1,j)) = (len (Lower_Seq C,n)) - (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) by A30, A185, JORDAN3:61;
Index p,do < len do by A182, JORDAN3:41;
then Index p,do < (len (Lower_Seq C,n)) -' (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) by A187, XREAL_0:def 2;
then (Index p,do) + 1 <= (len (Lower_Seq C,n)) -' (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) by NAT_1:13;
then A188: Index p,do <= ((len (Lower_Seq C,n)) -' (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n))) - 1 by XREAL_1:21;
A189: do = mid (Lower_Seq C,n),(((Gauge C,n) * i1,j) .. (Lower_Seq C,n)),(len (Lower_Seq C,n)) by A32, JORDAN1J:37;
p in L~ (Lower_Seq C,n) by A36, A182;
then p in (east_halfline (E-max C)) /\ (L~ (Cage C,n)) by A150, A181, XBOOLE_0:def 4;
then A190: p `1 = E-bound (L~ (Cage C,n)) by JORDAN1A:104, PSCOMP_1:111;
A191: (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) + 1 = ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) by A34, A32, JORDAN1J:56;
0 + (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) < len (Lower_Seq C,n) by A30, JORDAN3:41;
then (len (Lower_Seq C,n)) - (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n)) > 0 by XREAL_1:22;
then Index p,do <= ((len (Lower_Seq C,n)) - (Index ((Gauge C,n) * i1,j),(Lower_Seq C,n))) - 1 by A188, XREAL_0:def 2;
then Index p,do <= (len (Lower_Seq C,n)) - (((Gauge C,n) * i1,j) .. (Lower_Seq C,n)) by A191;
then Index p,do <= (len (Lower_Seq C,n)) -' (((Gauge C,n) * i1,j) .. (Lower_Seq C,n)) by XREAL_0:def 2;
then A192: Index p,do < ((len (Lower_Seq C,n)) -' (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) + 1 by NAT_1:13;
A193: 1 <= Index p,do by A182, JORDAN3:41;
A194: ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) <= len (Lower_Seq C,n) by A32, FINSEQ_4:31;
((Gauge C,n) * i1,j) .. (Lower_Seq C,n) <> len (Lower_Seq C,n) by A31, A32, FINSEQ_4:29;
then A195: ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) < len (Lower_Seq C,n) by A194, XXREAL_0:1;
A196: 1 + 1 <= len (Lower_Seq C,n) by A25, XXREAL_0:2;
then A197: 2 in dom (Lower_Seq C,n) by FINSEQ_3:27;
set tt = ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1;
set RC = Rotate (Cage C,n),(E-max (L~ (Cage C,n)));
A198: E-max C in right_cell (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))),1 by JORDAN1I:9;
A199: GoB (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) = GoB (Cage C,n) by REVROT_1:28
.= Gauge C,n by JORDAN1H:52 ;
A200: L~ (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) = L~ (Cage C,n) by REVROT_1:33;
consider jj2 being Element of NAT such that
A201: 1 <= jj2 and
A202: jj2 <= width (Gauge C,n) and
A203: E-max (L~ (Cage C,n)) = (Gauge C,n) * (len (Gauge C,n)),jj2 by JORDAN1D:29;
A204: len (Gauge C,n) >= 4 by JORDAN8:13;
then len (Gauge C,n) >= 1 by XXREAL_0:2;
then A205: [(len (Gauge C,n)),jj2] in Indices (Gauge C,n) by A201, A202, MATRIX_1:37;
A206: len (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) = len (Cage C,n) by REVROT_1:14;
Lower_Seq C,n = (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) -: (W-min (L~ (Cage C,n))) by JORDAN1G:26;
then A207: LSeg (Lower_Seq C,n),1 = LSeg (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))),1 by A196, SPPOL_2:9;
A208: E-max (L~ (Cage C,n)) in rng (Cage C,n) by SPRECT_2:50;
Rotate (Cage C,n),(E-max (L~ (Cage C,n))) is_sequence_on Gauge C,n by A146, REVROT_1:34;
then consider ii, jj being Element of NAT such that
A209: [ii,(jj + 1)] in Indices (Gauge C,n) and
A210: [ii,jj] in Indices (Gauge C,n) and
A211: (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) /. 1 = (Gauge C,n) * ii,(jj + 1) and
A212: (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) /. (1 + 1) = (Gauge C,n) * ii,jj by A136, A200, A206, A208, FINSEQ_6:98, JORDAN1I:25;
A213: (jj + 1) + 1 <> jj ;
A214: 1 <= jj by A210, MATRIX_1:39;
(Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) /. 1 = E-max (L~ (Rotate (Cage C,n),(E-max (L~ (Cage C,n))))) by A200, A208, FINSEQ_6:98;
then A215: ii = len (Gauge C,n) by A200, A209, A211, A203, A205, GOBOARD1:21;
then ii - 1 >= 4 - 1 by A204, XREAL_1:11;
then A216: ii - 1 >= 1 by XXREAL_0:2;
then A217: 1 <= ii -' 1 by XREAL_0:def 2;
A218: jj <= width (Gauge C,n) by A210, MATRIX_1:39;
then A219: ((Gauge C,n) * (len (Gauge C,n)),jj) `1 = E-bound (L~ (Cage C,n)) by A24, A214, JORDAN1A:92;
A220: jj + 1 <= width (Gauge C,n) by A209, MATRIX_1:39;
ii + 1 <> ii ;
then A221: right_cell (Rotate (Cage C,n),(E-max (L~ (Cage C,n)))),1 = cell (Gauge C,n),(ii -' 1),jj by A136, A206, A199, A209, A210, A211, A212, A213, GOBOARD5:def 6;
A222: ii <= len (Gauge C,n) by A210, MATRIX_1:39;
A223: 1 <= ii by A210, MATRIX_1:39;
A224: ii <= len (Gauge C,n) by A209, MATRIX_1:39;
A225: 1 <= jj + 1 by A209, MATRIX_1:39;
then A226: E-bound (L~ (Cage C,n)) = ((Gauge C,n) * (len (Gauge C,n)),(jj + 1)) `1 by A24, A220, JORDAN1A:92;
A227: 1 <= ii by A209, MATRIX_1:39;
then A228: (ii -' 1) + 1 = ii by XREAL_1:237;
then A229: ii -' 1 < len (Gauge C,n) by A224, NAT_1:13;
then A230: ((Gauge C,n) * (ii -' 1),(jj + 1)) `2 = ((Gauge C,n) * 1,(jj + 1)) `2 by A225, A220, A217, GOBOARD5:2
.= ((Gauge C,n) * ii,(jj + 1)) `2 by A227, A224, A225, A220, GOBOARD5:2 ;
A231: (E-max C) `2 = p `2 by A181, TOPREAL1:def 13;
then A232: p `2 <= ((Gauge C,n) * (ii -' 1),(jj + 1)) `2 by A198, A224, A220, A214, A221, A228, A216, JORDAN9:19;
A233: ((Gauge C,n) * (ii -' 1),jj) `2 = ((Gauge C,n) * 1,jj) `2 by A214, A218, A217, A229, GOBOARD5:2
.= ((Gauge C,n) * ii,jj) `2 by A223, A222, A214, A218, GOBOARD5:2 ;
((Gauge C,n) * (ii -' 1),jj) `2 <= p `2 by A231, A198, A224, A220, A214, A221, A228, A216, JORDAN9:19;
then p in LSeg ((Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) /. 1),((Rotate (Cage C,n),(E-max (L~ (Cage C,n)))) /. (1 + 1)) by A190, A211, A212, A215, A232, A233, A230, A219, A226, GOBOARD7:8;
then A234: p in LSeg (Lower_Seq C,n),1 by A136, A207, A206, TOPREAL1:def 5;
1 <= ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) by A32, FINSEQ_4:31;
then A235: LSeg (mid (Lower_Seq C,n),(((Gauge C,n) * i1,j) .. (Lower_Seq C,n)),(len (Lower_Seq C,n))),(Index p,do) = LSeg (Lower_Seq C,n),(((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1) by A195, A193, A192, JORDAN4:31;
1 <= Index ((Gauge C,n) * i1,j),(Lower_Seq C,n) by A30, JORDAN3:41;
then A236: 1 + 1 <= ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) by A191, XREAL_1:9;
then (Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n)) >= (1 + 1) + 1 by A193, XREAL_1:9;
then ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) - 1 >= ((1 + 1) + 1) - 1 by XREAL_1:11;
then A237: ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1 >= 1 + 1 by XREAL_0:def 2;
now
per cases ( ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1 > 1 + 1 or ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1 = 1 + 1 ) by A237, XXREAL_0:1;
suppose ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1 > 1 + 1 ; :: thesis: contradiction
then LSeg (Lower_Seq C,n),1 misses LSeg (Lower_Seq C,n),(((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1) by TOPREAL1:def 9;
hence contradiction by A234, A183, A189, A235, XBOOLE_0:3; :: thesis: verum
end;
suppose A238: ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1 = 1 + 1 ; :: thesis: contradiction
then 1 + 1 = ((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) - 1 by XREAL_0:def 2;
then (1 + 1) + 1 = (Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n)) ;
then A239: ((Gauge C,n) * i1,j) .. (Lower_Seq C,n) = 2 by A193, A236, JORDAN1E:10;
(LSeg (Lower_Seq C,n),1) /\ (LSeg (Lower_Seq C,n),(((Index p,do) + (((Gauge C,n) * i1,j) .. (Lower_Seq C,n))) -' 1)) = {((Lower_Seq C,n) /. 2)} by A25, A238, TOPREAL1:def 8;
then p in {((Lower_Seq C,n) /. 2)} by A234, A183, A189, A235, XBOOLE_0:def 4;
then A240: p = (Lower_Seq C,n) /. 2 by TARSKI:def 1;
then A241: p in rng (Lower_Seq C,n) by A197, PARTFUN2:4;
p .. (Lower_Seq C,n) = 2 by A197, A240, FINSEQ_5:44;
then p = (Gauge C,n) * i1,j by A32, A239, A241, FINSEQ_5:10;
then ((Gauge C,n) * i1,j) `1 = E-bound (L~ (Cage C,n)) by A240, JORDAN1G:40;
then ((Gauge C,n) * i1,j) `1 = ((Gauge C,n) * (len (Gauge C,n)),j) `1 by A4, A10, A24, JORDAN1A:92;
hence contradiction by A2, A3, A23, A15, JORDAN1G:7; :: thesis: verum
end;
end;
end;
hence contradiction ; :: thesis: verum
end;
end;
end;
then east_halfline (E-max C) c= (L~ godo) ` by SUBSET_1:43;
then consider W being Subset of (TOP-REAL 2) such that
A242: W is_a_component_of (L~ godo) ` and
A243: east_halfline (E-max C) c= W by GOBOARD9:5;
not W is Bounded by A243, JORDAN2C:16, JORDAN2C:129;
then W is_outside_component_of L~ godo by A242, JORDAN2C:def 4;
then W c= UBD (L~ godo) by JORDAN2C:27;
then A244: east_halfline (E-max C) c= UBD (L~ godo) by A243, XBOOLE_1:1;
E-max C in east_halfline (E-max C) by TOPREAL1:45;
then E-max C in UBD (L~ godo) by A244;
then E-max C in LeftComp godo by GOBRD14:46;
then Upper_Arc C meets L~ godo by A108, A142, A165, A140, A157, JORDAN1J:36;
then A245: ( Upper_Arc C meets (L~ go) \/ (L~ pion1) or Upper_Arc C meets L~ do ) by A139, XBOOLE_1:70;
hence contradiction ; :: thesis: verum
end;
suppose ((Gauge C,n) * i1,j) `1 = ((Gauge C,n) * i2,k) `1 ; :: thesis: contradiction
then A246: i1 = i2 by A23, A19, JORDAN1G:7;
then LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) = {((Gauge C,n) * i1,k)} by RLTOPSP1:71;
then LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) c= LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) by A40, ZFMISC_1:37;
then (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) = LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) by XBOOLE_1:12;
hence contradiction by A1, A3, A4, A5, A6, A7, A8, A9, A246, JORDAN1J:59; :: thesis: verum
end;
suppose ((Gauge C,n) * i1,j) `2 = ((Gauge C,n) * i2,k) `2 ; :: thesis: contradiction
then A247: j = k by A23, A19, JORDAN1G:6;
then LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) = {((Gauge C,n) * i1,k)} by RLTOPSP1:71;
then LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k) c= LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) by A39, ZFMISC_1:37;
then (LSeg ((Gauge C,n) * i1,j),((Gauge C,n) * i1,k)) \/ (LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k)) = LSeg ((Gauge C,n) * i1,k),((Gauge C,n) * i2,k) by XBOOLE_1:12;
hence contradiction by A1, A2, A3, A4, A6, A7, A8, A9, A247, Th31; :: thesis: verum
end;
end;
end;
hence contradiction ; :: thesis: verum