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 ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) & integral ((const ((LWBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) )

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 ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) & integral ((const ((LWBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) )

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 ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) & integral ((const ((LWBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) ) )
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 ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) & integral ((const ((LWBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) )
then 1 <= k by FINSEQ_1:1;
then k -' 1 <= k by XREAL_1:237;
then ['((k -' 1) / (n + 1)),(k / (n + 1))'] = [.((k -' 1) / (n + 1)),(k / (n + 1)).] by XREAL_1:72, INTEGRA5:def 3;
then A4: ( (k -' 1) / (n + 1) <= x0 & x0 <= k / (n + 1) ) by A1, XXREAL_1:1;
A5: dom (const ((UPBND_rng_d (f,n)) . k)) = REAL by FUNCT_2:def 1;
A6: for t being Real st t in ['x0,(k / (n + 1))'] holds
(const ((UPBND_rng_d (f,n)) . k)) . t = (UPBND_rng_d (f,n)) . k
proof
let t be Real; :: thesis: ( t in ['x0,(k / (n + 1))'] implies (const ((UPBND_rng_d (f,n)) . k)) . t = (UPBND_rng_d (f,n)) . k )
assume t in ['x0,(k / (n + 1))'] ; :: thesis: (const ((UPBND_rng_d (f,n)) . k)) . t = (UPBND_rng_d (f,n)) . k
then (const ((UPBND_rng_d (f,n)) . k)) . t in rng (const ((UPBND_rng_d (f,n)) . k)) by FUNCT_1:3, A5;
then (const ((UPBND_rng_d (f,n)) . k)) . t in {((UPBND_rng_d (f,n)) . k)} by Lm3;
hence (const ((UPBND_rng_d (f,n)) . k)) . t = (UPBND_rng_d (f,n)) . k by TARSKI:def 1; :: thesis: verum
end;
A10: dom (const ((LWBND_rng_d (f,n)) . k)) = REAL by FUNCT_2:def 1;
for t being Real st t in ['x0,(k / (n + 1))'] holds
(const ((LWBND_rng_d (f,n)) . k)) . t = (LWBND_rng_d (f,n)) . k
proof
let t be Real; :: thesis: ( t in ['x0,(k / (n + 1))'] implies (const ((LWBND_rng_d (f,n)) . k)) . t = (LWBND_rng_d (f,n)) . k )
assume t in ['x0,(k / (n + 1))'] ; :: thesis: (const ((LWBND_rng_d (f,n)) . k)) . t = (LWBND_rng_d (f,n)) . k
then (const ((LWBND_rng_d (f,n)) . k)) . t in rng (const ((LWBND_rng_d (f,n)) . k)) by FUNCT_1:3, A10;
then (const ((LWBND_rng_d (f,n)) . k)) . t in {((LWBND_rng_d (f,n)) . k)} by Lm3;
hence (const ((LWBND_rng_d (f,n)) . k)) . t = (LWBND_rng_d (f,n)) . k by TARSKI:def 1; :: thesis: verum
end;
hence ( integral ((const ((UPBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((UPBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) & integral ((const ((LWBND_rng_d (f,n)) . k)),x0,(k / (n + 1))) = ((LWBND_rng_d (f,n)) . k) * ((k / (n + 1)) - x0) ) by A6, A5, A4, INTEGRA6:26, A10; :: thesis: verum