let n, k be Nat; :: thesis: for x0 being Real
for f being PartFunc of REAL,REAL st k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] & f is_C^1-Class_on ['0,1'] holds
integral ((f `| rohl),x0,(k / (n + 1))) <= integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1)))

let x0 be Real; :: thesis: for f being PartFunc of REAL,REAL st k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] & f is_C^1-Class_on ['0,1'] holds
integral ((f `| rohl),x0,(k / (n + 1))) <= integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1)))

let f be PartFunc of REAL,REAL; :: thesis: ( k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] & f is_C^1-Class_on ['0,1'] implies integral ((f `| rohl),x0,(k / (n + 1))) <= integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) )
set df = f `| rohl;
set a = x0;
set b = k / (n + 1);
set X = ['0,1'];
assume A1: ( k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] & f is_C^1-Class_on ['0,1'] ) ; :: thesis: integral ((f `| rohl),x0,(k / (n + 1))) <= integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1)))
A2: ['0,1'] = [.0,1.] by INTEGRA5:def 3;
reconsider r = (UPBND_rng_d (f,n)) . k as Real ;
set g1 = const r;
1 <= k by A1, FINSEQ_1:1;
then A4: k -' 1 <= k by XREAL_1:237;
then A5: ['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).] by XREAL_1:72, INTEGRA5:def 3;
then A6: ( (k -' 1) / (n + 1) <= x0 & x0 <= k / (n + 1) ) by A1, XXREAL_1:1;
then A7: [.x0,(k / (n + 1)).] c= [.((k -' 1) / (n + 1)),(k / (n + 1)).] by XXREAL_1:34;
A8: x0 <= k / (n + 1) by A5, A1, XXREAL_1:1;
A9: x0 <= k / (n + 1) by A5, A1, XXREAL_1:1;
k <= n + 1 by A1, FINSEQ_1:1;
then k / (n + 1) <= (n + 1) / (n + 1) by XREAL_1:72;
then k / (n + 1) <= 1 by XCMPLX_1:60;
then [.x0,(k / (n + 1)).] c= ['0,1'] by A6, A2, XXREAL_1:34;
then A10: ['x0,(k / (n + 1))'] c= ['0,1'] by A9, INTEGRA5:def 3;
A11: ['x0,(k / (n + 1))'] = [.x0,(k / (n + 1)).] by A6, INTEGRA5:def 3;
A12: ['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).] by A4, XREAL_1:72, INTEGRA5:def 3;
dom (f `| rohl) = rohl by A1, FDIFF_1:def 7;
then A14: ( ['x0,(k / (n + 1))'] c= dom (f `| rohl) & f `| rohl is_integrable_on ['x0,(k / (n + 1))'] & (f `| rohl) | ['x0,(k / (n + 1))'] is bounded ) by A1, Lm5, XBOOLE_1:1, A10;
A15: ( ['x0,(k / (n + 1))'] c= dom (const r) & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded ) by A1, Lm4;
for x being Real st x in ['x0,(k / (n + 1))'] holds
(f `| rohl) . x <= (const r) . x
proof
let x be Real; :: thesis: ( x in ['x0,(k / (n + 1))'] implies (f `| rohl) . x <= (const r) . x )
assume A16: x in ['x0,(k / (n + 1))'] ; :: thesis: (f `| rohl) . x <= (const r) . x
len (UPBND_rng_d (f,n)) = n + 1 by Def8;
then A18: k in dom (UPBND_rng_d (f,n)) by A1, FINSEQ_1:def 3;
(const r) . x = (0 * x) + r by FCONT_1:def 4
.= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) by A18, Def8 ;
hence (f `| rohl) . x <= (const r) . x by A12, A11, A7, A16, A1, Lm8; :: thesis: verum
end;
hence integral ((f `| rohl),x0,(k / (n + 1))) <= integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) by A15, A14, A8, ORDEQ_01:48; :: thesis: verum