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
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . 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
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x ) )
set n1 = n + 1;
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
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x )
then A2:
( f is_differentiable_on rohl & f `| rohl is continuous & ['0,1'] c= rohl & rohl c= dom f & ['0,1'] c= dom f )
by XBOOLE_1:1;
A3:
['0,1'] = [.0,1.]
by INTEGRA5:def 3;
1 <= k
by A1, FINSEQ_1:1;
then
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;
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 A6:
['((k -' 1) / (n + 1)),(k / (n + 1))'] c= ['0,1']
by A3, A5, XXREAL_1:34;
set ck = (UPBND_rng_d (f,n)) . k;
set c1 = const ((UPBND_rng_d (f,n)) . k);
set g = ax_+_b ((- 1),(k / (n + 1)));
for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x )
proof
let x be
Real;
( x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] implies ( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x ) )
assume A7:
x in ['((k -' 1) / (n + 1)),(k / (n + 1))']
;
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x )
reconsider jj =
- 1 as
Real ;
A8:
(((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x =
((UPBND_rng_d (f,n)) . k) * ((AffineMap ((- 1),(k / (n + 1)))) . x)
by VALUED_1:6
.=
((UPBND_rng_d (f,n)) . k) * ((jj * x) + (k / (n + 1)))
by FCONT_1:def 4
.=
((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x)
;
A9:
(((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x =
((LWBND_rng_d (f,n)) . k) * ((AffineMap ((- 1),(k / (n + 1)))) . x)
by VALUED_1:6
.=
((LWBND_rng_d (f,n)) . k) * ((jj * x) + (k / (n + 1)))
by FCONT_1:def 4
.=
((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x)
;
A10:
dom ((f . (k / (n + 1))) + (- f)) =
dom ((- 1) (#) f)
by VALUED_1:def 2
.=
dom f
by VALUED_1:def 5
;
then A11:
((f . (k / (n + 1))) + (- f)) . x =
(f . (k / (n + 1))) + ((- f) . x)
by A7, A2, A6, VALUED_1:def 2
.=
(f . (k / (n + 1))) - (f . x)
by VALUED_1:8
;
A12:
dom (- f) = dom f
by VALUED_1:def 5;
A13:
dom ((const (f . (k / (n + 1)))) + (- f)) =
(dom (const (f . (k / (n + 1))))) /\ (dom (- f))
by VALUED_1:def 1
.=
REAL /\ (dom (- f))
by FUNCT_2:def 1
.=
dom f
by A12, XBOOLE_1:28
;
(const (f . (k / (n + 1)))) . x =
(0 * x) + (f . (k / (n + 1)))
by FCONT_1:def 4
.=
f . (k / (n + 1))
;
then ((f . (k / (n + 1))) + (- f)) . x =
((const (f . (k / (n + 1)))) . x) + ((- f) . x)
by A7, A2, A6, A10, VALUED_1:def 2
.=
((const (f . (k / (n + 1)))) + (- f)) . x
by A13, A7, A2, A6, VALUED_1:def 1
;
hence
(
((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x &
(((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x &
((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x )
by A8, Th8, A7, A1, A11, A9;
verum
end;
hence
for x being Real st x in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
( ((const (f . (k / (n + 1)))) + (- f)) . x <= (((UPBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x & (((LWBND_rng_d (f,n)) . k) (#) (ax_+_b ((- 1),(k / (n + 1))))) . x <= ((const (f . (k / (n + 1)))) + (- f)) . x & ((f . (k / (n + 1))) + (- f)) . x = ((const (f . (k / (n + 1)))) + (- f)) . x )
; verum