defpred S₁[ set ] means (Partial_Sums |.(0c ExpSeq ).|) . $1 = 1;
(Partial_Sums |.(0c ExpSeq ).|) . 0 = |.(0c ExpSeq ).| . 0 by SERIES_1:def 1
.= |.((0c ExpSeq ) . 0 ).| by VALUED_1:18
.= 1 by Th4, COMPLEX1:134 ;
then A1: S₁[ 0 ] ;
A2: for n being Nat st S₁[n] holds
S₁[n + 1]

proof

let n be Nat; :: thesis: ( S₁[n] implies S₁[n + 1] )
assume A3: (Partial_Sums |.(0c ExpSeq ).|) . n = 1 ; :: thesis: S₁[n + 1]
X: n in NAT by ORDINAL1:def 13;
thus (Partial_Sums |.(0c ExpSeq ).|) . (n + 1) = 1 + (|.(0c ExpSeq ).| . (n + 1)) by A3, X, SERIES_1:def 1
.= 1 + |.((0c ExpSeq ) . (n + 1)).| by VALUED_1:18
.= 1 + |.((((0c ExpSeq ) . n) * 0c ) / ((n + 1) + (0 * <i> ))).| by Th4, X
.= 1 by COMPLEX1:130 ; :: thesis: verum

end;

A4: 0c ExpSeq is absolutely_summable

proof

for n being Nat holds S₁[n] from NAT_1:sch 2(A1, A2);
then Partial_Sums |.(0c ExpSeq ).| is constant by VALUED_0:def 18;
hence |.(0c ExpSeq ).| is summable by SERIES_1:def 2; :: according to COMSEQ_3:def 11 :: thesis: verum

end;

defpred S₂[ set ] means (Partial_Sums (0c ExpSeq )) . $1 = 1;
(Partial_Sums (0c ExpSeq )) . 0 = (0c ExpSeq ) . 0 by COMSEQ_3:def 7
.= 1 by Th4 ;
then A5: S₂[ 0 ] ;
A6: for n being Element of NAT st S₂[n] holds
S₂[n + 1]

proof

let n be Element of NAT ; :: thesis: ( S₂[n] implies S₂[n + 1] )
assume A7: (Partial_Sums (0c ExpSeq )) . n = 1 ; :: thesis: S₂[n + 1]
thus (Partial_Sums (0c ExpSeq )) . (n + 1) = 1r + ((0c ExpSeq ) . (n + 1)) by A7, COMSEQ_3:def 7
.= 1r + ((((0c ExpSeq ) . n) * 0c ) / ((n + 1) + (0 * <i> ))) by Th4
.= 1 ; :: thesis: verum

end;

for n being Element of NAT holds S₂[n] from NAT_1:sch 1(A5, A6);
hence ( 0c ExpSeq is absolutely_summable & Sum (0c ExpSeq ) = 1r ) by A4, COMSEQ_2:10; :: thesis: verum