let f be nonnegative Function of [:NAT,NAT:],ExtREAL; :: thesis: for n, m being Nat st ( for i being Nat st i <= n holds
f . (i,m) is Real ) holds
(Partial_Sums_in_cod1 f) . (n,m) < +infty
let n, m be Nat; :: thesis: ( ( for i being Nat st i <= n holds
f . (i,m) is Real ) implies (Partial_Sums_in_cod1 f) . (n,m) < +infty )
assume A2: for i being Nat st i <= n holds
f . (i,m) is Real ; :: thesis: (Partial_Sums_in_cod1 f) . (n,m) < +infty
defpred S₁[ Nat] means ( $1 <= n implies (Partial_Sums_in_cod1 f) . ($1,m) < +infty );
(Partial_Sums_in_cod1 f) . (0,m) = f . (0,m) by DefRSM;
then (Partial_Sums_in_cod1 f) . (0,m) is Real by A2;
then A4: S₁[ 0 ] by XXREAL_0:9, XREAL_0:def 1;
A5: for k being Nat st S₁[k] holds
S₁[k + 1]

proof

let k be Nat; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume A6: S₁[k] ; :: thesis: S₁[k + 1]

now :: thesis: ( k + 1 <= n implies (Partial_Sums_in_cod1 f) . ((k + 1),m) < +infty )

assume A7: k + 1 <= n ; :: thesis: (Partial_Sums_in_cod1 f) . ((k + 1),m) < +infty
then A8: ( f . ((k + 1),m) is Real & f . ((k + 1),m) >= 0 ) by A2, SUPINF_2:51;
(Partial_Sums_in_cod1 f) . ((k + 1),m) = ((Partial_Sums_in_cod1 f) . (k,m)) + (f . ((k + 1),m)) by DefRSM;
hence (Partial_Sums_in_cod1 f) . ((k + 1),m) < +infty by A6, A7, A8, NAT_1:13, XXREAL_3:16, XXREAL_0:4; :: thesis: verum

end;

hence S₁[k + 1] ; :: thesis: verum

end;

for k being Nat holds S₁[k] from NAT_1:sch 2(A4, A5);
hence (Partial_Sums_in_cod1 f) . (n,m) < +infty ; :: thesis: verum