let n be Nat; :: thesis: for f being non empty FinSequence of () st n in dom f & ( for m being Nat st m in dom f holds
() . n <= () . m ) holds
f /. n in rng (Col ((GoB f),1))

let f be non empty FinSequence of (); :: thesis: ( n in dom f & ( for m being Nat st m in dom f holds
() . n <= () . m ) implies f /. n in rng (Col ((GoB f),1)) )

set x = X_axis f;
set y = Y_axis f;
set r = () . n;
assume that
A1: n in dom f and
A2: for m being Nat st m in dom f holds
() . n <= () . m ; :: thesis: f /. n in rng (Col ((GoB f),1))
reconsider p = f /. n as Point of () ;
A3: dom f = Seg (len f) by FINSEQ_1:def 3;
A4: ( dom () = Seg (len ()) & len () = len f ) by ;
then A5: (Y_axis f) . n = p `2 by ;
A6: rng (Incr ()) = rng () by SEQ_4:def 21;
(Y_axis f) . n in rng () by ;
then consider j being Nat such that
A7: j in dom (Incr ()) and
A8: (Incr ()) . j = p `2 by ;
reconsider j = j as Element of NAT by ORDINAL1:def 12;
A9: 1 <= j by ;
then reconsider j1 = j - 1 as Element of NAT by INT_1:5;
A10: j <= len (Incr ()) by ;
A11: now :: thesis: not j <> 1
reconsider s = (Incr ()) . j1 as Real ;
assume j <> 1 ; :: thesis: contradiction
then 1 < j by ;
then 1 + 1 <= j by NAT_1:13;
then A12: 1 <= j1 by XREAL_1:19;
j1 <= j by XREAL_1:44;
then j1 <= len (Incr ()) by ;
then A13: j1 in dom (Incr ()) by ;
then (Incr ()) . j1 in rng (Incr ()) by FUNCT_1:def 3;
then A14: ex m being Nat st
( m in dom () & () . m = s ) by ;
j1 < j by XREAL_1:44;
then s < () . n by ;
hence contradiction by A2, A3, A4, A14; :: thesis: verum
end;
A15: rng (Incr ()) = rng () by SEQ_4:def 21;
( dom () = Seg (len ()) & len () = len f ) by ;
then ( (X_axis f) . n = p `1 & () . n in rng () ) by ;
then consider i being Nat such that
A16: i in dom (Incr ()) and
A17: (Incr ()) . i = p `1 by ;
A18: p = |[(p `1),(p `2)]| by EUCLID:53;
len (Col ((GoB f),1)) = len (GoB f) by MATRIX_0:def 8;
then A19: dom (Col ((GoB f),1)) = dom (GoB f) by FINSEQ_3:29;
( len (GoB f) = card (rng ()) & len (Incr ()) = card (rng ()) ) by ;
then A20: dom (Incr ()) = dom (GoB f) by FINSEQ_3:29;
( width (GoB f) = card (rng ()) & len (Incr ()) = card (rng ()) ) by ;
then ( Indices (GoB f) = [:(dom (GoB f)),(Seg (width (GoB f))):] & dom (Incr ()) = Seg (width (GoB f)) ) by ;
then [i,1] in Indices (GoB f) by ;
then (GoB f) * (i,1) = |[(p `1),(p `2)]| by A17, A8, A11, Def1;
then (Col ((GoB f),1)) . i = f /. n by ;
hence f /. n in rng (Col ((GoB f),1)) by ; :: thesis: verum