let n, m be Nat; ((Fib m) * (Lucas n)) + ((Lucas m) * (Fib n)) = GenFib (Fib 0 ),(Lucas 0 ),(n + m)
defpred S1[ Nat] means ((Fib $1) * (Lucas n)) + ((Lucas $1) * (Fib n)) = GenFib (Fib 0 ),(Lucas 0 ),(n + $1);
2 * (Fib n) = GenFib 0 ,2,n
then A5:
S1[ 0 ]
by Th11, PRE_FF:1;
(Lucas n) + (Fib n) = GenFib 0 ,2,(n + 1)
proof
defpred S2[
Nat]
means (Lucas $1) + (Fib $1) = GenFib 0 ,2,
($1 + 1);
A6:
for
j being
Nat st
S2[
j] &
S2[
j + 1] holds
S2[
j + 2]
(Lucas 1) + (Fib 1) =
0 + (GenFib 0 ,2,1)
by Th11, Th32, PRE_FF:1
.=
(GenFib 0 ,2,(0 + 0 )) + (GenFib 0 ,2,(0 + 1))
by Th32
.=
GenFib 0 ,2,
(0 + 2)
by Th34
.=
GenFib 0 ,2,
(1 + 1)
;
then A8:
S2[1]
;
A9:
S2[
0 ]
by Th11, Th32, PRE_FF:1;
for
j being
Nat holds
S2[
j]
from FIB_NUM:sch 1(A9, A8, A6);
hence
(Lucas n) + (Fib n) = GenFib 0 ,2,
(n + 1)
;
verum
end;
then A10:
S1[1]
by Th11, PRE_FF:1;
A11:
for k being Nat st S1[k] & S1[k + 1] holds
S1[k + 2]
proof
let k be
Nat;
( S1[k] & S1[k + 1] implies S1[k + 2] )
assume A12:
(
S1[
k] &
S1[
k + 1] )
;
S1[k + 2]
((Fib (k + 2)) * (Lucas n)) + ((Lucas (k + 2)) * (Fib n)) =
(((Fib k) + (Fib (k + 1))) * (Lucas n)) + ((Lucas (k + 2)) * (Fib n))
by FIB_NUM2:26
.=
(((Fib k) * (Lucas n)) + ((Fib (k + 1)) * (Lucas n))) + (((Lucas k) + (Lucas (k + 1))) * (Fib n))
by Th12
.=
(GenFib 0 ,2,(n + k)) + (GenFib 0 ,2,((n + k) + 1))
by A12, Th11, PRE_FF:1
.=
GenFib 0 ,2,
((n + k) + 2)
by Th34
.=
GenFib (Fib 0 ),
(Lucas 0 ),
(n + (k + 2))
by Th11, PRE_FF:1
;
hence
S1[
k + 2]
;
verum
end;
for k being Nat holds S1[k]
from FIB_NUM:sch 1(A5, A10, A11);
hence
((Fib m) * (Lucas n)) + ((Lucas m) * (Fib n)) = GenFib (Fib 0 ),(Lucas 0 ),(n + m)
; verum