let n be Nat; :: thesis: for f being PartFunc of REAL,REAL st f is_C^1-Class_on ['0,1'] holds
(1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . n) <= (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1)))

let f be PartFunc of REAL,REAL; :: thesis: ( f is_C^1-Class_on ['0,1'] implies (1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . n) <= (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) )
set n1 = n + 1;
set F1 = (In ((1 / (n + 1)),F_Real)) * (step_ (f,n));
assume A1: f is_C^1-Class_on ['0,1'] ; :: thesis: (1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . n) <= (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1)))
A2: len (LWBND_rng_d (f,n)) = n + 1 by Def9;
then A3: dom (LWBND_rng_d (f,n)) = Seg (n + 1) by FINSEQ_1:def 3;
reconsider r1 = 1 / (n + 1) as Real ;
reconsider r2 = 1 / (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A4: dom (r1 * (LWBND_rng_d (f,n))) = dom (LWBND_rng_d (f,n)) by VALUED_1:def 5;
A5: vol ['0,1'] = 1 - 0 by INTEGRA6:5;
then A6: EqDiv (['0,1'],(n + 1)) divide_into_equal n + 1 by MESFUN14:def 1;
then A7: len (EqDiv (['0,1'],(n + 1))) = n + 1 by INTEGRA4:def 1;
set Dn = EqDiv (['0,1'],(n + 1));
A8: len (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) = len (EqDiv (['0,1'],(n + 1))) by INTEGRA1:def 7
.= n + 1 by A6, INTEGRA4:def 1 ;
for k being Nat st k in dom (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) holds
(lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (LWBND_rng_d (f,n))) . k
proof
let k be Nat; :: thesis: ( k in dom (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) implies (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (LWBND_rng_d (f,n))) . k )
assume k in dom (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) ; :: thesis: (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (LWBND_rng_d (f,n))) . k
then A10: k in Seg (n + 1) by A8, FINSEQ_1:def 3;
then A11: k in dom (EqDiv (['0,1'],(n + 1))) by A7, FINSEQ_1:def 3;
then A12: vol (divset ((EqDiv (['0,1'],(n + 1))),k)) = 1 / (n + 1) by A5, A6, MESFUN14:15;
(k -' 1) / (n + 1) <= k / (n + 1) by NAT_D:35, XREAL_1:72;
then A13: ['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).] by INTEGRA5:def 3;
A14: @' (f,['0,1']) = (f `| rohl) | ['0,1'] by A1, Def6;
A15: k in dom (LWBND_rng_d (f,n)) by A2, FINSEQ_1:def 3, A10;
(r1 * (LWBND_rng_d (f,n))) . k = (1 / (n + 1)) * ((LWBND_rng_d (f,n)) . k) by A4, A15, VALUED_1:def 5
.= (lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']))) * (1 / (n + 1)) by A15, Def9
.= (lower_bound (rng ((f `| rohl) | (divset ((EqDiv (['0,1'],(n + 1))),k))))) * (vol (divset ((EqDiv (['0,1'],(n + 1))),k))) by A12, A10, Th1, A13
.= (lower_bound (rng (((f `| rohl) | ['0,1']) | (divset ((EqDiv (['0,1'],(n + 1))),k))))) * (vol (divset ((EqDiv (['0,1'],(n + 1))),k))) by A11, INTEGRA1:8, RELAT_1:74
.= (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k by A14, A11, INTEGRA1:def 7 ;
hence (lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1))))) . k = (r1 * (LWBND_rng_d (f,n))) . k ; :: thesis: verum
end;
then A16: lower_volume ((@' (f,['0,1'])),(EqDiv (['0,1'],(n + 1)))) = r1 * (LWBND_rng_d (f,n)) by A8, FINSEQ_1:def 3, A3, A4;
n in NAT by ORDINAL1:def 12;
then A18: lower_sum ((@' (f,['0,1'])),(D[01] . n)) = Sum (r1 * (LWBND_rng_d (f,n))) by A16, Def1
.= Sum (r1 * (@ (LWBND_rng_d (f,n)))) by MATRTOP1:def 2
.= r1 * (Sum (@ (LWBND_rng_d (f,n)))) by RVSUM_1:87 ;
reconsider r1 = 1 / (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A19: dom ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) = dom (step_ (f,n)) by POLYNOM1:def 1
.= Seg (n + 1) by Def14 ;
then A20: dom ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) = dom ('G' (f,n)) by Def13;
reconsider H = LWBND_rng_d (f,n) as FinSequence of F_Real ;
reconsider FG = ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)) as FinSequence of F_Real ;
reconsider r3 = 2 * (n + 1) as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A21: dom (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))) = Seg (n + 1) by A19, BINOM:def 1;
Seg (len (r3 * FG)) = Seg (len (FG * r3)) by BINOM:6
.= dom (FG * r3) by FINSEQ_1:def 3
.= dom FG by POLYNOM1:def 2
.= Seg (len FG) by FINSEQ_1:def 3 ;
then A22: len (r3 * FG) = len FG by FINSEQ_1:6
.= n + 1 by A21, FINSEQ_1:def 3 ;
len H = n + 1 by Def9;
then A24: dom H = Seg (n + 1) by FINSEQ_1:def 3;
dom (r2 * H) = dom H by POLYNOM1:def 1;
then A25: len (r2 * H) = len H by FINSEQ_3:29
.= n + 1 by Def9 ;
A26: for k being Nat st k in dom (r2 * H) holds
(r2 * H) . k <= (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k
proof
let k be Nat; :: thesis: ( k in dom (r2 * H) implies (r2 * H) . k <= (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k )
assume A27: k in dom (r2 * H) ; :: thesis: (r2 * H) . k <= (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k
then A28: k in Seg (n + 1) by A25, FINSEQ_1:def 3;
then A29: k in dom (r3 * FG) by A22, FINSEQ_1:def 3;
A30: k in dom FG by A21, A25, A27, FINSEQ_1:def 3;
then A31: r3 * (FG . k) = r3 * (FG /. k) by PARTFUN1:def 6
.= (r3 * FG) /. k by A30, POLYNOM1:def 1
.= (r3 * FG) . k by A29, PARTFUN1:def 6 ;
A32: k in dom H by A24, A25, A27, FINSEQ_1:def 3;
A33: (r2 * H) . k = (r2 * H) /. k by A27, PARTFUN1:def 6
.= r2 * (H /. k) by A32, POLYNOM1:def 1
.= r2 * (H . k) by A32, PARTFUN1:def 6 ;
(((1 / (n + 1)) ^2) / 2) * (2 * (n + 1)) = (1 / (n + 1)) * ((1 / (n + 1)) * (n + 1))
.= (1 / (n + 1)) * 1 by XCMPLX_1:87 ;
then A35: (((H . k) * ((1 / (n + 1)) ^2)) / 2) * (2 * (n + 1)) = (H . k) * (1 / (n + 1)) ;
(((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n))) . k = integral (((const (f . (k / (n + 1)))) + (- f)),((k -' 1) / (n + 1)),(k / (n + 1))) by Lm24, A1, A28;
hence (r2 * H) . k <= (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) . k by A31, A33, A35, XREAL_1:64, Lm23, A1, A28; :: thesis: verum
end;
A37: Sum (r3 * (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) = r3 * (Sum (((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) + ('G' (f,n)))) by FVSUM_1:73
.= r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (Sum ('G' (f,n)))) by A20, BINOM:7
.= r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) by Lm22, A1 ;
reconsider rf = Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) as Element of F_Real ;
reconsider r0 = n + 1 as Element of F_Real by XREAL_0:def 1, VECTSP_1:def 5;
A38: r0 * r1 = In (1,REAL) by XCMPLX_1:106;
A39: r0 * ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))) = (r0 * r1) * (step_ (f,n)) by Lm25
.= step_ (f,n) by Lm26, A38, VECTSP_1:def 5 ;
A40: (n + 1) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) = (r0 * (Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n))))) + (r0 * (integral ((- f),0,1)))
.= (Sum (step_ (f,n))) + (r0 * (integral ((- f),0,1))) by A39, FVSUM_1:73 ;
A41: Sum (r2 * H) = r2 * (Sum H) by FVSUM_1:73
.= lower_sum ((@' (f,['0,1'])),(D[01] . n)) by A18, MATRPROB:36, MATRTOP1:def 2 ;
lower_sum ((@' (f,['0,1'])),(D[01] . n)) <= r3 * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) by A37, A41, A26, A22, A25, E_TRANS1:2;
then (lower_sum ((@' (f,['0,1'])),D[01])) . n <= (2 * (n + 1)) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1))) by INTEGRA2:def 3;
then (1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . n) <= (1 / 2) * ((2 * (n + 1)) * ((Sum ((In ((1 / (n + 1)),F_Real)) * (step_ (f,n)))) + (integral ((- f),0,1)))) by XREAL_1:64;
hence (1 / 2) * ((lower_sum ((@' (f,['0,1'])),D[01])) . n) <= (Sum (step_ (f,n))) + ((n + 1) * (integral ((- f),0,1))) by A40; :: thesis: verum