let k, n be Element of NAT ; :: thesis: for G being Go-board
for f being FinSequence of (TOP-REAL 2) st k in dom G & f is_sequence_on G & f /. (len f) in rng (Line G,(len G)) & n in dom f & f /. n in rng (Line G,k) holds
( ( for i being Element of NAT st k <= i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,i) ) ) & ( for i being Element of NAT st k < i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) ) ) )

let G be Go-board; :: thesis: for f being FinSequence of (TOP-REAL 2) st k in dom G & f is_sequence_on G & f /. (len f) in rng (Line G,(len G)) & n in dom f & f /. n in rng (Line G,k) holds
( ( for i being Element of NAT st k <= i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,i) ) ) & ( for i being Element of NAT st k < i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) ) ) )

let f be FinSequence of (TOP-REAL 2); :: thesis: ( k in dom G & f is_sequence_on G & f /. (len f) in rng (Line G,(len G)) & n in dom f & f /. n in rng (Line G,k) implies ( ( for i being Element of NAT st k <= i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,i) ) ) & ( for i being Element of NAT st k < i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) ) ) ) )

assume that
A1: k in dom G and
A2: f is_sequence_on G and
A3: f /. (len f) in rng (Line G,(len G)) and
A4: n in dom f and
A5: f /. n in rng (Line G,k) ; :: thesis: ( ( for i being Element of NAT st k <= i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,i) ) ) & ( for i being Element of NAT st k < i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) ) ) )

A6: ( 1 <= k & k <= len G & dom f = Seg (len f) ) by A1, FINSEQ_1:def 3, FINSEQ_3:27;
A7: ( 1 <= n & n <= len f ) by A4, FINSEQ_3:27;
defpred S1[ Element of NAT ] means ( k <= $1 & $1 <= len G implies ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,$1) ) );
A8: S1[ 0 ] by A1, FINSEQ_3:27;
A9: for i being Element of NAT st S1[i] holds
S1[i + 1]
proof
let i be Element of NAT ; :: thesis: ( S1[i] implies S1[i + 1] )
assume A10: S1[i] ; :: thesis: S1[i + 1]
assume A11: ( k <= i + 1 & i + 1 <= len G ) ; :: thesis: ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) )

now
per cases ( k = i + 1 or k < i + 1 ) by A11, XXREAL_0:1;
suppose A12: k = i + 1 ; :: thesis: ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) )

take j = n; :: thesis: ( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) )
thus ( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) ) by A4, A5, A12; :: thesis: verum
end;
suppose A13: k < i + 1 ; :: thesis: ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) )

then ( k <= i & i <= i + 1 & k <= i + 1 ) by NAT_1:13;
then ( 1 <= i & i <= len G & 1 <= i + 1 & k <= i ) by A6, A11, XXREAL_0:2;
then A14: ( i in dom G & i + 1 in dom G ) by A11, FINSEQ_3:27;
defpred S2[ Nat] means ( $1 in dom f & n <= $1 & f /. $1 in rng (Line G,i) );
A15: ex j being Nat st S2[j] by A10, A11, A13, NAT_1:13;
A16: for j being Nat st S2[j] holds
j <= len f by FINSEQ_3:27;
consider ma being Nat such that
A17: ( S2[ma] & ( for j being Nat st S2[j] holds
j <= ma ) ) from NAT_1:sch 6(A16, A15);
A18: 1 <= len f by A7, XXREAL_0:2;
A19: now
let j be Element of NAT ; :: thesis: ( j in dom f & f /. j in rng (Line G,i) implies j <= ma )
assume A20: ( j in dom f & f /. j in rng (Line G,i) ) ; :: thesis: j <= ma
now
per cases ( j < n or n <= j ) ;
suppose n <= j ; :: thesis: j <= ma
hence j <= ma by A17, A20; :: thesis: verum
end;
end;
end;
hence j <= ma ; :: thesis: verum
end;
take j = ma + 1; :: thesis: ( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) )
thus j in dom f by A2, A3, A14, A17, A18, A19, Th44; :: thesis: ( n <= j & f /. j in rng (Line G,(i + 1)) )
ma <= ma + 1 by NAT_1:11;
hence ( n <= j & f /. j in rng (Line G,(i + 1)) ) by A2, A3, A14, A17, A18, A19, Th44, XXREAL_0:2; :: thesis: verum
end;
end;
end;
hence ex j being Element of NAT st
( j in dom f & n <= j & f /. j in rng (Line G,(i + 1)) ) ; :: thesis: verum
end;
thus A21: for i being Element of NAT holds S1[i] from NAT_1:sch 1(A8, A9); :: thesis: for i being Element of NAT st k < i & i <= len G holds
ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) )

let i be Element of NAT ; :: thesis: ( k < i & i <= len G implies ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) ) )

assume A22: ( k < i & i <= len G ) ; :: thesis: ex j being Element of NAT st
( j in dom f & n < j & f /. j in rng (Line G,i) )

then consider j being Element of NAT such that
A23: ( j in dom f & n <= j & f /. j in rng (Line G,i) ) by A21;
1 <= i by A6, A22, XXREAL_0:2;
then A24: i in dom G by A22, FINSEQ_3:27;
take j ; :: thesis: ( j in dom f & n < j & f /. j in rng (Line G,i) )
thus j in dom f by A23; :: thesis: ( n < j & f /. j in rng (Line G,i) )
n <> j by A1, A5, A22, A23, A24, Th19;
hence ( n < j & f /. j in rng (Line G,i) ) by A23, XXREAL_0:1; :: thesis: verum