reserve a,b,n for Element of NAT;

theorem
  for n being Element of NAT holds GenFib(0,1,n) = Fib(n)
proof
  defpred P[Nat] means GenFib(0,1,$1) = Fib($1);
A1: P[1] by Th32,PRE_FF:1;
A2: for k being Nat st P[k] & P[k+1] holds P[k+2]
  proof
    let k be Nat;
    assume ( P[k])& P[k+1];
    then GenFib(0,1,k+2)=Fib(k)+Fib(k+1) by Th34
      .=Fib(k+2) by FIB_NUM2:24;
    hence thesis;
  end;
A3: P[0] by Th32,PRE_FF:1;
  for k being Nat holds P[k] from FIB_NUM:sch 1 (A3, A1, A2);
  hence thesis;
end;
