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

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

set X = ['0,1'];
set g = f `| rohl;
A2: ['0,1'] = [.0,1.] by INTEGRA5:def 3;
assume A1: ( k in Seg (n + 1) & f is_C^1-Class_on ['0,1'] ) ; :: thesis: for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
(f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']))

then 1 <= k by FINSEQ_1:1;
then A4: k -' 1 <= k by XREAL_1:237;
for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
(f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']))
proof
let x be Real; :: thesis: ( x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] implies (f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) )
assume A5: x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] ; :: thesis: (f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']))
k <= n + 1 by A1, FINSEQ_1:1;
then k / (n + 1) <= (n + 1) / (n + 1) by XREAL_1:72;
then A6: k / (n + 1) <= 1 by XCMPLX_1:60;
A7: ['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).] by A4, XREAL_1:72, INTEGRA5:def 3;
A8: [.((k -' 1) / (n + 1)),(k / (n + 1)).] c= [.0,1.] by A6, XXREAL_1:34;
dom (f `| rohl) = rohl by A1, FDIFF_1:def 7;
then A10: x in dom ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']) by A5, RELAT_1:62, A8, A7, A2, A1, XBOOLE_1:1;
((f `| rohl) | [.((k -' 1) / (n + 1)),(k / (n + 1)).]) . x = (f `| rohl) . x by A7, A5, FUNCT_1:49;
then A11: (f `| rohl) . x in rng ((f `| rohl) | [.((k -' 1) / (n + 1)),(k / (n + 1)).]) by A7, A10, FUNCT_1:3;
(f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'] is bounded by A1, Lm7;
then rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))']) is bounded_above by INTEGRA1:13;
hence (f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) by A7, A11, SEQ_4:def 1; :: thesis: verum
end;
hence for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
(f `| rohl) . x <= upper_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) ; :: thesis: verum