let F, G be sequence of ExtREAL; :: thesis: for n being Nat st ( for m being Nat st m <= n holds
F . m <= G . m ) holds
(Ser F) . n <= (Ser G) . n

let n be Nat; :: thesis: ( ( for m being Nat st m <= n holds
F . m <= G . m ) implies (Ser F) . n <= (Ser G) . n )

assume A1: for m being Nat st m <= n holds
F . m <= G . m ; :: thesis: (Ser F) . n <= (Ser G) . n
defpred S1[ Nat] means ( ( for m being Nat st m <= \$1 holds
F . m <= G . m ) implies (Ser F) . \$1 <= (Ser G) . \$1 );
A2: for k being Nat st S1[k] holds
S1[k + 1]
proof
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A3: S1[k] ; :: thesis: S1[k + 1]
now :: thesis: ( ( for m being Nat st m <= k + 1 holds
F . m <= G . m ) implies (Ser F) . (k + 1) <= (Ser G) . (k + 1) )
assume A4: for m being Nat st m <= k + 1 holds
F . m <= G . m ; :: thesis: (Ser F) . (k + 1) <= (Ser G) . (k + 1)
A5: now :: thesis: for m being Nat st m <= k holds
F . m <= G . m
let m be Nat; :: thesis: ( m <= k implies F . m <= G . m )
assume m <= k ; :: thesis: F . m <= G . m
then m < k + 1 by NAT_1:13;
hence F . m <= G . m by A4; :: thesis: verum
end;
F . (k + 1) <= G . (k + 1) by A4;
then ((Ser F) . k) + (F . (k + 1)) <= ((Ser G) . k) + (G . (k + 1)) by ;
then (Ser F) . (k + 1) <= ((Ser G) . k) + (G . (k + 1)) by SUPINF_2:def 11;
hence (Ser F) . (k + 1) <= (Ser G) . (k + 1) by SUPINF_2:def 11; :: thesis: verum
end;
hence S1[k + 1] ; :: thesis: verum
end;
now :: thesis: ( ( for m being Nat st m <= 0 holds
F . m <= G . m ) implies (Ser F) . 0 <= (Ser G) . 0 )
A6: ( (Ser F) . 0 = F . 0 & (Ser G) . 0 = G . 0 ) by SUPINF_2:def 11;
assume for m being Nat st m <= 0 holds
F . m <= G . m ; :: thesis: (Ser F) . 0 <= (Ser G) . 0
hence (Ser F) . 0 <= (Ser G) . 0 by A6; :: thesis: verum
end;
then A7: S1[ 0 ] ;
for k being Nat holds S1[k] from NAT_1:sch 2(A7, A2);
hence (Ser F) . n <= (Ser G) . n by A1; :: thesis: verum