defpred S1[ Nat, object , object ] means $3 = [$2,(p . ($1 + 1))];
A1: for i being Nat st 1 <= i & i < n holds
for x being set ex y being set st S1[i,x,y]
proof
let i be Nat; :: thesis: ( 1 <= i & i < n implies for x being set ex y being set st S1[i,x,y] )
assume ( 1 <= i & i < n ) ; :: thesis: for x being set ex y being set st S1[i,x,y]
let x be set ; :: thesis: ex y being set st S1[i,x,y]
reconsider y = [x,(p . (i + 1))] as set by TARSKI:1;
take y ; :: thesis: S1[i,x,y]
thus S1[i,x,y] ; :: thesis: verum
end;
consider F being FinSequence such that
A2: ( len F = n & ( F . 1 = p . 1 or n = 0 ) & ( for i being Nat st 1 <= i & i < n holds
S1[i,F . i,F . (i + 1)] ) ) from RECDEF_1:sch 3(A1);
reconsider F = F as n -element FinSequence by A2, CARD_1:def 7;
take F ; :: thesis: ( F . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F . (i + 1) = [(F . i),(p . (i + 1))] ) )

thus ( F . 1 = p . 1 & ( for i being non zero Nat st i < n holds
F . (i + 1) = [(F . i),(p . (i + 1))] ) ) by A2, NAT_1:14; :: thesis: verum