let f, g be Function of [:NAT, the carrier of R:], the carrier of R; ( ( for a being Element of R holds
( f . (0,a) = 0. R & ( for n being Nat holds f . ((n + 1),a) = a + (f . (n,a)) ) ) ) & ( for a being Element of R holds
( g . (0,a) = 0. R & ( for n being Nat holds g . ((n + 1),a) = a + (g . (n,a)) ) ) ) implies f = g )
assume A2:
for a being Element of R holds
( f . (0,a) = 0. R & ( for n being Nat holds f . ((n + 1),a) = a + (f . (n,a)) ) )
; ( ex a being Element of R st
( g . (0,a) = 0. R implies ex n being Nat st not g . ((n + 1),a) = a + (g . (n,a)) ) or f = g )
defpred S1[ Nat] means for a being Element of R holds f . ($1,a) = g . ($1,a);
assume A3:
for a being Element of R holds
( g . (0,a) = 0. R & ( for n being Nat holds g . ((n + 1),a) = a + (g . (n,a)) ) )
; f = g
A4:
now for n being Nat st S1[n] holds
S1[n + 1]let n be
Nat;
( S1[n] implies S1[n + 1] )assume A5:
S1[
n]
;
S1[n + 1]hence
S1[
n + 1]
;
verum end;
A6:
S1[ 0 ]
A7:
for n being Nat holds S1[n]
from NAT_1:sch 2(A6, A4);
( dom f = [:NAT, the carrier of R:] & dom g = [:NAT, the carrier of R:] )
by FUNCT_2:def 1;
hence
f = g
by A8, FUNCT_1:2; verum