let n, k be Nat; 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
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
let f be PartFunc of REAL,REAL; ( 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
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x )
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'] )
; for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
then
1 <= k
by FINSEQ_1:1;
then A3:
k -' 1 <= k
by XREAL_1:237;
for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
proof
let x be
Real;
( x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] implies lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x )
assume A4:
x in ['((k -' 1) / (n + 1)),(k / (n + 1))']
;
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
k <= n + 1
by A1, FINSEQ_1:1;
then
k / (n + 1) <= (n + 1) / (n + 1)
by XREAL_1:72;
then A5:
k / (n + 1) <= 1
by XCMPLX_1:60;
A6:
['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).]
by A3, XREAL_1:72, INTEGRA5:def 3;
A7:
dom (f `| rohl) = rohl
by A1, FDIFF_1:def 7;
[.((k -' 1) / (n + 1)),(k / (n + 1)).] c= [.0,1.]
by A5, XXREAL_1:34;
then A9:
x in dom ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])
by A4, A7, RELAT_1:62, A6, A2, A1, XBOOLE_1:1;
((f `| rohl) | [.((k -' 1) / (n + 1)),(k / (n + 1)).]) . x = (f `| rohl) . x
by A6, A4, FUNCT_1:49;
then A10:
(f `| rohl) . x in rng ((f `| rohl) | [.((k -' 1) / (n + 1)),(k / (n + 1)).])
by A6, A9, 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_below
by INTEGRA1:11;
hence
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
by A6, A10, SEQ_4:def 2;
verum
end;
hence
for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
lower_bound (rng ((f `| rohl) | ['((k -' 1) / (n + 1)),(k / (n + 1))'])) <= (f `| rohl) . x
; verum