let X be non empty set ; :: thesis: for F being Functional_Sequence of X,ExtREAL
for x being Element of X
for D being set st F is additive & F is with_the_same_dom & D c= dom (F . 0) & x in D holds
( ( Partial_Sums (F # x) is convergent_to_finite_number implies (Partial_Sums F) # x is convergent_to_finite_number ) & ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )

let F be Functional_Sequence of X,ExtREAL; :: thesis: for x being Element of X
for D being set st F is additive & F is with_the_same_dom & D c= dom (F . 0) & x in D holds
( ( Partial_Sums (F # x) is convergent_to_finite_number implies (Partial_Sums F) # x is convergent_to_finite_number ) & ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )

let x be Element of X; :: thesis: for D being set st F is additive & F is with_the_same_dom & D c= dom (F . 0) & x in D holds
( ( Partial_Sums (F # x) is convergent_to_finite_number implies (Partial_Sums F) # x is convergent_to_finite_number ) & ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )

let D be set ; :: thesis: ( F is additive & F is with_the_same_dom & D c= dom (F . 0) & x in D implies ( ( Partial_Sums (F # x) is convergent_to_finite_number implies (Partial_Sums F) # x is convergent_to_finite_number ) & ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) ) )
set PFx = Partial_Sums (F # x);
set PF = Partial_Sums F;
assume that
A1: F is additive and
A2: F is with_the_same_dom and
A3: D c= dom (F . 0) and
A4: x in D ; :: thesis: ( ( Partial_Sums (F # x) is convergent_to_finite_number implies (Partial_Sums F) # x is convergent_to_finite_number ) & ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
hereby :: thesis: ( ( (Partial_Sums F) # x is convergent_to_finite_number implies Partial_Sums (F # x) is convergent_to_finite_number ) & ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
assume Partial_Sums (F # x) is convergent_to_finite_number ; :: thesis: (Partial_Sums F) # x is convergent_to_finite_number
then consider g being Real such that
A6: for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p ;
now :: thesis: for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p
let p be Real; :: thesis: ( 0 < p implies ex n being Nat st
for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p )

assume 0 < p ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p

then consider n being Nat such that
A7: for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p by A6;
take n = n; :: thesis: for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p

let m be Nat; :: thesis: ( n <= m implies |.((((Partial_Sums F) # x) . m) - g).| < p )
assume A8: n <= m ; :: thesis: |.((((Partial_Sums F) # x) . m) - g).| < p
(Partial_Sums (F # x)) . m = ((Partial_Sums F) # x) . m by A1, A2, A3, A4, Th32;
hence |.((((Partial_Sums F) # x) . m) - g).| < p by A7, A8; :: thesis: verum
end;
hence (Partial_Sums F) # x is convergent_to_finite_number ; :: thesis: verum
end;
hereby :: thesis: ( ( Partial_Sums (F # x) is convergent_to_+infty implies (Partial_Sums F) # x is convergent_to_+infty ) & ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
assume (Partial_Sums F) # x is convergent_to_finite_number ; :: thesis: Partial_Sums (F # x) is convergent_to_finite_number
then consider g being Real such that
A10: for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p ;
now :: thesis: for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p
let p be Real; :: thesis: ( 0 < p implies ex n being Nat st
for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p )

assume 0 < p ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p

then consider n being Nat such that
A11: for m being Nat st n <= m holds
|.((((Partial_Sums F) # x) . m) - g).| < p by A10;
take n = n; :: thesis: for m being Nat st n <= m holds
|.(((Partial_Sums (F # x)) . m) - g).| < p

let m be Nat; :: thesis: ( n <= m implies |.(((Partial_Sums (F # x)) . m) - g).| < p )
assume A12: n <= m ; :: thesis: |.(((Partial_Sums (F # x)) . m) - g).| < p
(Partial_Sums (F # x)) . m = ((Partial_Sums F) # x) . m by A1, A2, A3, A4, Th32;
hence |.(((Partial_Sums (F # x)) . m) - g).| < p by A11, A12; :: thesis: verum
end;
hence Partial_Sums (F # x) is convergent_to_finite_number ; :: thesis: verum
end;
hereby :: thesis: ( ( (Partial_Sums F) # x is convergent_to_+infty implies Partial_Sums (F # x) is convergent_to_+infty ) & ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
assume A14: Partial_Sums (F # x) is convergent_to_+infty ; :: thesis: (Partial_Sums F) # x is convergent_to_+infty
now :: thesis: for r being Real st 0 < r holds
ex n being Nat st
for m being Nat st n <= m holds
r <= ((Partial_Sums F) # x) . m
let r be Real; :: thesis: ( 0 < r implies ex n being Nat st
for m being Nat st n <= m holds
r <= ((Partial_Sums F) # x) . m )

assume 0 < r ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
r <= ((Partial_Sums F) # x) . m

then consider n being Nat such that
A15: for m being Nat st n <= m holds
r <= (Partial_Sums (F # x)) . m by A14;
take n = n; :: thesis: for m being Nat st n <= m holds
r <= ((Partial_Sums F) # x) . m

let m be Nat; :: thesis: ( n <= m implies r <= ((Partial_Sums F) # x) . m )
assume n <= m ; :: thesis: r <= ((Partial_Sums F) # x) . m
then r <= (Partial_Sums (F # x)) . m by A15;
hence r <= ((Partial_Sums F) # x) . m by A1, A2, A3, A4, Th32; :: thesis: verum
end;
hence (Partial_Sums F) # x is convergent_to_+infty ; :: thesis: verum
end;
hereby :: thesis: ( ( Partial_Sums (F # x) is convergent_to_-infty implies (Partial_Sums F) # x is convergent_to_-infty ) & ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
assume A17: (Partial_Sums F) # x is convergent_to_+infty ; :: thesis: Partial_Sums (F # x) is convergent_to_+infty
now :: thesis: for r being Real st 0 < r holds
ex n being Nat st
for m being Nat st n <= m holds
r <= (Partial_Sums (F # x)) . m
let r be Real; :: thesis: ( 0 < r implies ex n being Nat st
for m being Nat st n <= m holds
r <= (Partial_Sums (F # x)) . m )

assume 0 < r ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
r <= (Partial_Sums (F # x)) . m

then consider n being Nat such that
A18: for m being Nat st n <= m holds
r <= ((Partial_Sums F) # x) . m by A17;
take n = n; :: thesis: for m being Nat st n <= m holds
r <= (Partial_Sums (F # x)) . m

let m be Nat; :: thesis: ( n <= m implies r <= (Partial_Sums (F # x)) . m )
assume n <= m ; :: thesis: r <= (Partial_Sums (F # x)) . m
then r <= ((Partial_Sums F) # x) . m by A18;
hence r <= (Partial_Sums (F # x)) . m by A1, A2, A3, A4, Th32; :: thesis: verum
end;
hence Partial_Sums (F # x) is convergent_to_+infty ; :: thesis: verum
end;
hereby :: thesis: ( ( (Partial_Sums F) # x is convergent_to_-infty implies Partial_Sums (F # x) is convergent_to_-infty ) & ( Partial_Sums (F # x) is convergent implies (Partial_Sums F) # x is convergent ) & ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) )
assume A20: Partial_Sums (F # x) is convergent_to_-infty ; :: thesis: (Partial_Sums F) # x is convergent_to_-infty
now :: thesis: for r being Real st r < 0 holds
ex n being Nat st
for m being Nat st n <= m holds
((Partial_Sums F) # x) . m <= r
let r be Real; :: thesis: ( r < 0 implies ex n being Nat st
for m being Nat st n <= m holds
((Partial_Sums F) # x) . m <= r )

assume r < 0 ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
((Partial_Sums F) # x) . m <= r

then consider n being Nat such that
A21: for m being Nat st n <= m holds
(Partial_Sums (F # x)) . m <= r by A20;
take n = n; :: thesis: for m being Nat st n <= m holds
((Partial_Sums F) # x) . m <= r

let m be Nat; :: thesis: ( n <= m implies ((Partial_Sums F) # x) . m <= r )
assume n <= m ; :: thesis: ((Partial_Sums F) # x) . m <= r
then (Partial_Sums (F # x)) . m <= r by A21;
hence ((Partial_Sums F) # x) . m <= r by A1, A2, A3, A4, Th32; :: thesis: verum
end;
hence (Partial_Sums F) # x is convergent_to_-infty ; :: thesis: verum
end;
hereby :: thesis: ( Partial_Sums (F # x) is convergent iff (Partial_Sums F) # x is convergent )
assume A23: (Partial_Sums F) # x is convergent_to_-infty ; :: thesis: Partial_Sums (F # x) is convergent_to_-infty
now :: thesis: for r being Real st r < 0 holds
ex n being Nat st
for m being Nat st n <= m holds
(Partial_Sums (F # x)) . m <= r
let r be Real; :: thesis: ( r < 0 implies ex n being Nat st
for m being Nat st n <= m holds
(Partial_Sums (F # x)) . m <= r )

assume r < 0 ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
(Partial_Sums (F # x)) . m <= r

then consider n being Nat such that
A24: for m being Nat st n <= m holds
((Partial_Sums F) # x) . m <= r by A23;
take n = n; :: thesis: for m being Nat st n <= m holds
(Partial_Sums (F # x)) . m <= r

let m be Nat; :: thesis: ( n <= m implies (Partial_Sums (F # x)) . m <= r )
assume n <= m ; :: thesis: (Partial_Sums (F # x)) . m <= r
then ((Partial_Sums F) # x) . m <= r by A24;
hence (Partial_Sums (F # x)) . m <= r by A1, A2, A3, A4, Th32; :: thesis: verum
end;
hence Partial_Sums (F # x) is convergent_to_-infty ; :: thesis: verum
end;
hereby :: thesis: ( (Partial_Sums F) # x is convergent implies Partial_Sums (F # x) is convergent ) end;
assume A26: (Partial_Sums F) # x is convergent ; :: thesis: Partial_Sums (F # x) is convergent
per cases ( (Partial_Sums F) # x is convergent_to_+infty or (Partial_Sums F) # x is convergent_to_-infty or (Partial_Sums F) # x is convergent_to_finite_number ) by A26;
end;