let f be FinSequence of (TOP-REAL 2); :: thesis: for r being Real
for u being Point of (Euclid 2)
for m being Nat st not f /. 1 in Ball (u,r) & 1 <= m & m <= (len f) - 1 & ( for i being Nat st 1 <= i & i <= (len f) - 1 & (LSeg (f,i)) /\ (Ball (u,r)) <> {} holds
m <= i ) holds
not f /. m in Ball (u,r)

let r be Real; :: thesis: for u being Point of (Euclid 2)
for m being Nat st not f /. 1 in Ball (u,r) & 1 <= m & m <= (len f) - 1 & ( for i being Nat st 1 <= i & i <= (len f) - 1 & (LSeg (f,i)) /\ (Ball (u,r)) <> {} holds
m <= i ) holds
not f /. m in Ball (u,r)

let u be Point of (Euclid 2); :: thesis: for m being Nat st not f /. 1 in Ball (u,r) & 1 <= m & m <= (len f) - 1 & ( for i being Nat st 1 <= i & i <= (len f) - 1 & (LSeg (f,i)) /\ (Ball (u,r)) <> {} holds
m <= i ) holds
not f /. m in Ball (u,r)

let m be Nat; :: thesis: ( not f /. 1 in Ball (u,r) & 1 <= m & m <= (len f) - 1 & ( for i being Nat st 1 <= i & i <= (len f) - 1 & (LSeg (f,i)) /\ (Ball (u,r)) <> {} holds
m <= i ) implies not f /. m in Ball (u,r) )

assume that
A1: not f /. 1 in Ball (u,r) and
A2: 1 <= m and
A3: m <= (len f) - 1 and
A4: for i being Nat st 1 <= i & i <= (len f) - 1 & (LSeg (f,i)) /\ (Ball (u,r)) <> {} holds
m <= i ; :: thesis: not f /. m in Ball (u,r)
assume A5: f /. m in Ball (u,r) ; :: thesis: contradiction
per cases ( 1 = m or 1 < m ) by A2, XXREAL_0:1;
end;