let n be Nat; :: thesis: for C being connected compact non horizontal non vertical Subset of ()
for i being Nat st 1 <= i & i < len (Gauge (C,n)) holds
not (Gauge (C,n)) * (i,(width (Gauge (C,n)))) in rng (Lower_Seq (C,n))

let C be connected compact non horizontal non vertical Subset of (); :: thesis: for i being Nat st 1 <= i & i < len (Gauge (C,n)) holds
not (Gauge (C,n)) * (i,(width (Gauge (C,n)))) in rng (Lower_Seq (C,n))

let i be Nat; :: thesis: ( 1 <= i & i < len (Gauge (C,n)) implies not (Gauge (C,n)) * (i,(width (Gauge (C,n)))) in rng (Lower_Seq (C,n)) )
set wi = width (Gauge (C,n));
assume that
A1: ( 1 <= i & i < len (Gauge (C,n)) ) and
A2: (Gauge (C,n)) * (i,(width (Gauge (C,n)))) in rng (Lower_Seq (C,n)) ; :: thesis: contradiction
consider i2 being Nat such that
A3: i2 in dom (Lower_Seq (C,n)) and
A4: (Lower_Seq (C,n)) . i2 = (Gauge (C,n)) * (i,(width (Gauge (C,n)))) by ;
reconsider i2 = i2 as Nat ;
A5: ( 1 <= i2 & i2 <= len (Lower_Seq (C,n)) ) by ;
3 <= len (Upper_Seq (C,n)) by JORDAN1E:15;
then A6: 2 <= len (Upper_Seq (C,n)) by XXREAL_0:2;
set f = Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))));
set i1 = (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n));
A7: len (Gauge (C,n)) = width (Gauge (C,n)) by JORDAN8:def 1;
E-max (L~ (Cage (C,n))) in rng (Cage (C,n)) by SPRECT_2:46;
then A8: (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) /. 1 = E-max (L~ (Cage (C,n))) by FINSEQ_6:92;
L~ (Cage (C,n)) = L~ (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) by REVROT_1:33;
then A9: ( (S-max (L~ (Cage (C,n)))) .. (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) < (S-min (L~ (Cage (C,n)))) .. (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) & (S-min (L~ (Cage (C,n)))) .. (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) <= (W-min (L~ (Cage (C,n)))) .. (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) ) by ;
A10: ( W-min (L~ (Cage (C,n))) in rng (Cage (C,n)) & rng (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) = rng (Cage (C,n)) ) by ;
(W-min (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) = len (Lower_Seq (C,n)) by Th30;
then (S-min (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) <= len (Lower_Seq (C,n)) by Th29;
then A11: (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) < len (Lower_Seq (C,n)) by ;
( (E-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) = 1 & (E-min (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) <= (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) ) by ;
then A12: (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) > 1 by ;
then A13: (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) in dom (Lower_Seq (C,n)) by ;
( Lower_Seq (C,n) = (Rotate ((Cage (C,n)),(E-max (L~ (Cage (C,n)))))) -: (W-min (L~ (Cage (C,n)))) & S-max (L~ (Cage (C,n))) in rng (Cage (C,n)) ) by ;
then A14: S-max (L~ (Cage (C,n))) in rng (Lower_Seq (C,n)) by ;
then A15: (Lower_Seq (C,n)) /. ((S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n))) = S-max (L~ (Cage (C,n))) by FINSEQ_5:38;
A16: ( (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) in NAT & i2 in NAT ) by ORDINAL1:def 12;
A17: (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) <> i2
proof
assume (S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)) = i2 ; :: thesis: contradiction
then (Gauge (C,n)) * (i,(width (Gauge (C,n)))) = S-max (L~ (Cage (C,n))) by ;
then ((Gauge (C,n)) * (i,(width (Gauge (C,n))))) `2 = S-bound (L~ (Cage (C,n))) by EUCLID:52;
then N-bound (L~ (Cage (C,n))) = S-bound (L~ (Cage (C,n))) by ;
hence contradiction by SPRECT_1:16; :: thesis: verum
end;
then mid ((Lower_Seq (C,n)),((S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n))),i2) is being_S-Seq by ;
then reconsider h = mid ((Lower_Seq (C,n)),((S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n))),i2) as one-to-one special FinSequence of () ;
A18: (h /. 1) `2 = ((Lower_Seq (C,n)) /. ((S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n)))) `2 by
.= (S-max (L~ (Cage (C,n)))) `2 by
.= S-bound (L~ (Cage (C,n))) by EUCLID:52 ;
len h >= 1 by ;
then len h > 1 by ;
then A19: 1 + 1 <= len h by NAT_1:13;
A20: h is_in_the_area_of Cage (C,n) by ;
(h /. (len h)) `2 = ((Lower_Seq (C,n)) /. i2) `2 by
.= ((Gauge (C,n)) * (i,(width (Gauge (C,n))))) `2 by
.= N-bound (L~ (Cage (C,n))) by ;
then h is_a_v.c._for Cage (C,n) by ;
then L~ (Upper_Seq (C,n)) meets L~ h by ;
then consider x being object such that
A21: x in L~ (Upper_Seq (C,n)) and
A22: x in L~ h by XBOOLE_0:3;
L~ (mid ((Lower_Seq (C,n)),((S-max (L~ (Cage (C,n)))) .. (Lower_Seq (C,n))),i2)) c= L~ (Lower_Seq (C,n)) by ;
then x in (L~ (Lower_Seq (C,n))) /\ (L~ (Upper_Seq (C,n))) by ;
then A23: x in {(W-min (L~ (Cage (C,n)))),(E-max (L~ (Cage (C,n))))} by JORDAN1E:16;
4 <= len (Gauge (C,n)) by JORDAN8:10;
then A24: 1 <= len (Gauge (C,n)) by XXREAL_0:2;
per cases ( x = E-max (L~ (Cage (C,n))) or x = W-min (L~ (Cage (C,n))) ) by ;
suppose x = E-max (L~ (Cage (C,n))) ; :: thesis: contradiction
then x = (Lower_Seq (C,n)) /. 1 by JORDAN1F:6;
then i2 = 1 by A12, A11, A5, A22, Th37;
then (Lower_Seq (C,n)) /. 1 = (Gauge (C,n)) * (i,(width (Gauge (C,n)))) by ;
then E-max (L~ (Cage (C,n))) = (Gauge (C,n)) * (i,(width (Gauge (C,n)))) by JORDAN1F:6;
then ((Gauge (C,n)) * (i,(width (Gauge (C,n))))) `1 = E-bound (L~ (Cage (C,n))) by EUCLID:52
.= ((Gauge (C,n)) * ((len (Gauge (C,n))),(width (Gauge (C,n))))) `1 by ;
hence contradiction by A1, A7, A24, GOBOARD5:3; :: thesis: verum
end;
suppose x = W-min (L~ (Cage (C,n))) ; :: thesis: contradiction
then x = (Lower_Seq (C,n)) /. (len (Lower_Seq (C,n))) by JORDAN1F:8;
then i2 = len (Lower_Seq (C,n)) by A12, A11, A5, A22, Th38;
then (Lower_Seq (C,n)) /. (len (Lower_Seq (C,n))) = (Gauge (C,n)) * (i,(width (Gauge (C,n)))) by ;
then A25: W-min (L~ (Cage (C,n))) = (Gauge (C,n)) * (i,(width (Gauge (C,n)))) by JORDAN1F:8;
(NW-corner (L~ (Cage (C,n)))) `2 >= (W-max (L~ (Cage (C,n)))) `2 by PSCOMP_1:30;
then (NW-corner (L~ (Cage (C,n)))) `2 > (W-min (L~ (Cage (C,n)))) `2 by ;
then N-bound (L~ (Cage (C,n))) > ((Gauge (C,n)) * (i,(width (Gauge (C,n))))) `2 by ;
hence contradiction by A1, A7, JORDAN1A:70; :: thesis: verum
end;
end;