let f, g be FinSequence of NAT ; :: thesis: ( len f = (n - a) - 1 & ( for i being Nat st 1 <= i & i <= len f holds
f . i = Triangle (a + i) ) & len g = (n - a) - 1 & ( for i being Nat st 1 <= i & i <= len g holds
g . i = Triangle (a + i) ) implies f = g )

assume that
A4: len f = (n - a) - 1 and
A5: for i being Nat st 1 <= i & i <= len f holds
f . i = Triangle (a + i) and
A6: len g = (n - a) - 1 and
A7: for i being Nat st 1 <= i & i <= len g holds
g . i = Triangle (a + i) ; :: thesis: f = g
thus len f = len g by A4, A6; :: according to FINSEQ_1:def 18 :: thesis: for b1 being set holds
( not 1 <= b1 or not b1 <= len f or f . b1 = g . b1 )

let i be Nat; :: thesis: ( not 1 <= i or not i <= len f or f . i = g . i )
assume A8: ( 1 <= i & i <= len f ) ; :: thesis: f . i = g . i
thus f . i = Triangle (a + i) by A5, A8
.= g . i by A4, A6, A7, A8 ; :: thesis: verum