let f be FinSequence of (TOP-REAL 2); :: thesis: for p being Point of (TOP-REAL 2)
for i1 being Nat st f is being_S-Seq & 1 < i1 & i1 <= len f & p = f . i1 holds
(Index p,f) + 1 = i1

let p be Point of (TOP-REAL 2); :: thesis: for i1 being Nat st f is being_S-Seq & 1 < i1 & i1 <= len f & p = f . i1 holds
(Index p,f) + 1 = i1

let i1 be Nat; :: thesis: ( f is being_S-Seq & 1 < i1 & i1 <= len f & p = f . i1 implies (Index p,f) + 1 = i1 )
assume A1: f is being_S-Seq ; :: thesis: ( not 1 < i1 or not i1 <= len f or not p = f . i1 or (Index p,f) + 1 = i1 )
assume A2: ( 1 < i1 & i1 <= len f ) ; :: thesis: ( not p = f . i1 or (Index p,f) + 1 = i1 )
then A3: i1 in dom f by FINSEQ_3:27;
consider j being Nat such that
A4: i1 = j + 1 by A2, NAT_1:6;
reconsider j = j as Element of NAT by ORDINAL1:def 13;
A5: 1 + 0 <= j by A2, A4, NAT_1:13;
assume p = f . i1 ; :: thesis: (Index p,f) + 1 = i1
then A6: p = f /. i1 by A3, PARTFUN1:def 8;
then A7: p in LSeg f,j by A2, A4, A5, TOPREAL1:27;
then A8: Index p,f <= j by Th40;
assume (Index p,f) + 1 <> i1 ; :: thesis: contradiction
then Index p,f < j by A4, A8, XXREAL_0:1;
then A9: (Index p,f) + 1 <= j by NAT_1:13;
A10: LSeg f,j c= L~ f by TOPREAL3:26;
then A11: p in LSeg f,(Index p,f) by A7, Th42;
per cases ( (Index p,f) + 1 = j or (Index p,f) + 1 < j ) by A9, XXREAL_0:1;
end;