let f be PartFunc of REAL,REAL; :: thesis: ( f is_C^1-Class_on ['0,1'] implies ( w_seq f is convergent & ( for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - ((1 / 2) * (integral ((f `| rohl) || ['0,1'])))).| < p ) ) )

assume A1: f is_C^1-Class_on ['0,1'] ; :: thesis: ( w_seq f is convergent & ( for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - ((1 / 2) * (integral ((f `| rohl) || ['0,1'])))).| < p ) )

then A2: @' (f,['0,1']) = (f `| rohl) | ['0,1'] by Def6;
(f `| rohl) || ['0,1'] is integrable by A1, Lm6, INTEGRA5:def 1;
then A4: lim (lower_sum ((@' (f,['0,1'])),D[01])) = integral (@' (f,['0,1'])) by A1, A2, Lm19;
reconsider r0 = integral ((f `| rohl) || ['0,1']) as Real ;
A5: r0 = integral (@' (f,['0,1'])) by A1, Def6
.= lim (upper_sum ((@' (f,['0,1'])),D[01])) by Lm16, A1 ;
reconsider r1 = (1 / 2) * r0 as Real ;
set u1 = upper_sum ((@' (f,['0,1'])),D[01]);
set l1 = lower_sum ((@' (f,['0,1'])),D[01]);
A6: upper_sum ((@' (f,['0,1'])),D[01]) is convergent by A1, Lm16;
A7: lower_sum ((@' (f,['0,1'])),D[01]) is convergent by A1, Lm19;
for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - r1).| < p
proof
let p be Real; :: thesis: ( 0 < p implies ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - r1).| < p )

assume A8: 0 < p ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - r1).| < p

then consider n being Nat such that
A9: for m being Nat st n <= m holds
|.(((upper_sum ((@' (f,['0,1'])),D[01])) . m) - (lim (upper_sum ((@' (f,['0,1'])),D[01])))).| < p by A6, SEQ_2:def 7;
consider k being Nat such that
A10: for m being Nat st k <= m holds
|.(((lower_sum ((@' (f,['0,1'])),D[01])) . m) - (lim (lower_sum ((@' (f,['0,1'])),D[01])))).| < p by A8, A7, SEQ_2:def 7;
reconsider m0 = max (n,k) as Element of NAT by ORDINAL1:def 12;
( dom (Sum_step f) = NAT & NAT = dom (n_Integral f) ) by FUNCT_2:def 1;
then A12: dom ((Sum_step f) + (n_Integral f)) = NAT /\ NAT by VALUED_1:def 1
.= NAT ;
for i being Nat st m0 <= i holds
|.(((w_seq f) . i) - r1).| < p
proof
let i be Nat; :: thesis: ( m0 <= i implies |.(((w_seq f) . i) - r1).| < p )
assume A14: m0 <= i ; :: thesis: |.(((w_seq f) . i) - r1).| < p
reconsider i0 = i as Element of NAT by ORDINAL1:def 12;
n <= m0 by XXREAL_0:25;
then n <= i by A14, XXREAL_0:2;
then A15: |.(((upper_sum ((@' (f,['0,1'])),D[01])) . i) - (lim (upper_sum ((@' (f,['0,1'])),D[01])))).| < p by A9;
A16: (1 / 2) * p < p by A8, XREAL_1:157;
A17: - p < (1 / 2) * (- p) by A8, XREAL_1:156;
A18: ((Sum (step_ (f,i0))) + ((i0 + 1) * (integral ((- f),0,1)))) - ((1 / 2) * (lim (upper_sum ((@' (f,['0,1'])),D[01])))) <= ((1 / 2) * ((upper_sum ((@' (f,['0,1'])),D[01])) . i0)) - ((1 / 2) * (lim (upper_sum ((@' (f,['0,1'])),D[01])))) by Lm27, A1, XREAL_1:9;
reconsider x = ((upper_sum ((@' (f,['0,1'])),D[01])) . i0) - (lim (upper_sum ((@' (f,['0,1'])),D[01]))) as Real ;
( x <= p & - p <= x ) by A15, ABSVALUE:5;
then (1 / 2) * x <= (1 / 2) * p by XREAL_1:64;
then A19: ((Sum (step_ (f,i0))) + ((i0 + 1) * (integral ((- f),0,1)))) - ((1 / 2) * (lim (upper_sum ((@' (f,['0,1'])),D[01])))) <= (1 / 2) * p by A18, XXREAL_0:2;
k <= m0 by XXREAL_0:25;
then k <= i by A14, XXREAL_0:2;
then A20: |.(((lower_sum ((@' (f,['0,1'])),D[01])) . i) - (lim (lower_sum ((@' (f,['0,1'])),D[01])))).| < p by A10;
A21: ((1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . i0)) - ((1 / 2) * (lim (lower_sum ((@' (f,['0,1'])),D[01])))) <= ((Sum (step_ (f,i0))) + ((i0 + 1) * (integral ((- f),0,1)))) - ((1 / 2) * (lim (lower_sum ((@' (f,['0,1'])),D[01])))) by Lm28, A1, XREAL_1:9;
reconsider x = ((lower_sum ((@' (f,['0,1'])),D[01])) . i0) - (lim (lower_sum ((@' (f,['0,1'])),D[01]))) as Real ;
( x <= p & - p <= x ) by A20, ABSVALUE:5;
then (1 / 2) * (- p) <= (1 / 2) * x by XREAL_1:64;
then A22: (1 / 2) * (- p) <= ((Sum (step_ (f,i0))) + ((i0 + 1) * (integral ((- f),0,1)))) - ((1 / 2) * (lim (lower_sum ((@' (f,['0,1'])),D[01])))) by A21, XXREAL_0:2;
A23: (w_seq f) . i0 = ((Sum_step f) . i0) + ((n_Integral f) . i0) by A12, VALUED_1:def 1
.= (Sum (step_ (f,i0))) + ((n_Integral f) . i0) by Def15
.= (Sum (step_ (f,i0))) + ((i0 + 1) * (integral ((- f),0,1))) by Def16 ;
A24: - p < ((w_seq f) . i0) - r1 by A22, A17, XXREAL_0:2, A23, A4, A2;
per cases ( |.(((w_seq f) . i0) - r1).| = ((w_seq f) . i0) - r1 or |.(((w_seq f) . i0) - r1).| = - (((w_seq f) . i0) - r1) ) by ABSVALUE:1;
suppose |.(((w_seq f) . i0) - r1).| = ((w_seq f) . i0) - r1 ; :: thesis: |.(((w_seq f) . i) - r1).| < p
hence |.(((w_seq f) . i) - r1).| < p by A5, A19, A16, XXREAL_0:2, A23; :: thesis: verum
end;
suppose A25: |.(((w_seq f) . i0) - r1).| = - (((w_seq f) . i0) - r1) ; :: thesis: |.(((w_seq f) . i) - r1).| < p
reconsider a = ((w_seq f) . i0) - r1, b = - 1 as Real ;
b * a < b * (- p) by A24, XREAL_1:69;
hence |.(((w_seq f) . i) - r1).| < p by A25; :: thesis: verum
end;
end;
end;
hence ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - r1).| < p ; :: thesis: verum
end;
hence ( w_seq f is convergent & ( for p being Real st 0 < p holds
ex n being Nat st
for m being Nat st n <= m holds
|.(((w_seq f) . m) - ((1 / 2) * (integral ((f `| rohl) || ['0,1'])))).| < p ) ) ; :: thesis: verum