let F1, F2 be Function of NAT,ExtREAL; :: thesis: ( ( for n being Element of NAT holds F1 . n <= F2 . n ) implies for n being Element of NAT holds (Ser F1) . n <= (Ser F2) . n )
reconsider N2 = F2 as Num of rng F2 by Def16;
defpred S₁[ Element of NAT ] means (Ser F1) . $1 <= (Ser F2) . $1;
reconsider N1 = F1 as Num of rng F1 by Def16;
assume A1: for n being Element of NAT holds F1 . n <= F2 . n ; :: thesis: for n being Element of NAT holds (Ser F1) . n <= (Ser F2) . n
let n be Element of NAT ; :: thesis: (Ser F1) . n <= (Ser F2) . n
A2: Ser F2 = Ser ((rng F2),N2) by Def21;
then A3: (Ser F2) . 0 = F2 . 0 by Def17;
A4: Ser F1 = Ser ((rng F1),N1) by Def21;
A5: for k being Element of NAT st S₁[k] holds
S₁[k + 1]

proof

let k be Element of NAT ; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume A6: (Ser F1) . k <= (Ser F2) . k ; :: thesis: S₁[k + 1]
A7: F1 . (k + 1) <= F2 . (k + 1) by A1;
A8: (Ser F2) . (k + 1) = ((Ser F2) . k) + (F2 . (k + 1)) by A2, Def17;
(Ser F1) . (k + 1) = ((Ser F1) . k) + (F1 . (k + 1)) by A4, Def17;
hence S₁[k + 1] by A6, A8, A7, XXREAL_3:38; :: thesis: verum

end;

(Ser F1) . 0 = F1 . 0 by A4, Def17;
then A9: S₁[ 0 ] by A1, A3;
for n being Element of NAT holds S₁[n] from NAT_1:sch 1(A9, A5);
hence (Ser F1) . n <= (Ser F2) . n ; :: thesis: verum