let F1, F2 be n -element FinSequence; :: thesis: ( F1 . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F1 . (i + 1) = [(F1 . i),(p . (i + 1))] ) & F2 . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F2 . (i + 1) = [(F2 . i),(p . (i + 1))] ) implies F1 = F2 )

assume that
A3: ( F1 . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F1 . (i + 1) = [(F1 . i),(p . (i + 1))] ) ) and
A4: ( F2 . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F2 . (i + 1) = [(F2 . i),(p . (i + 1))] ) ) ; :: thesis: F1 = F2
defpred S1[ Nat, object , object ] means $3 = [$2,(p . ($1 + 1))];
A5: for i being Nat st 1 <= i & i < n holds
for x, y1, y2 being set st S1[i,x,y1] & S1[i,x,y2] holds
y1 = y2 ;
A6: ( dom F1 = Seg n & dom F2 = Seg n ) by FINSEQ_1:89;
A7: ( dom F1 = Seg (len F1) & dom F2 = Seg (len F2) ) by FINSEQ_1:def 3;
then A8: ( len F1 = n & ( F1 . 1 = p . 1 or n = 0 ) & ( for i being Nat st 1 <= i & i < n holds
S1[i,F1 . i,F1 . (i + 1)] ) ) by A3, A6, FINSEQ_1:6;
A9: ( len F2 = n & ( F2 . 1 = p . 1 or n = 0 ) & ( for i being Nat st 1 <= i & i < n holds
S1[i,F2 . i,F2 . (i + 1)] ) ) by A4, A6, A7, FINSEQ_1:6;
thus F1 = F2 from RECDEF_1:sch 7(A5, A8, A9); :: thesis: verum