let n, k be Nat; :: thesis: for m being non zero Nat
for x0, r being Real st k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
( ['x0,(k / (n + 1))'] c= dom (const r) & (const r) | ['x0,(k / (n + 1))'] is continuous & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded )

let m be non zero Nat; :: thesis: for x0, r being Real st k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] holds
( ['x0,(k / (n + 1))'] c= dom (const r) & (const r) | ['x0,(k / (n + 1))'] is continuous & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded )

let x0, r be Real; :: thesis: ( k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] implies ( ['x0,(k / (n + 1))'] c= dom (const r) & (const r) | ['x0,(k / (n + 1))'] is continuous & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded ) )
set f = const r;
set a = x0;
set b = k / (n + 1);
set X = REAL ;
assume A1: ( k in Seg (n + 1) & x0 in ['((k -' 1) / (n + 1)),(k / (n + 1))'] ) ; :: thesis: ( ['x0,(k / (n + 1))'] c= dom (const r) & (const r) | ['x0,(k / (n + 1))'] is continuous & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded )
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: x0 <= k / (n + 1) by A1, XXREAL_1:1;
A5: [.x0,(k / (n + 1)).] c= REAL ;
( REAL c= dom (const r) & ['((k -' 1) / m),(k / m)'] c= REAL & (const r) | REAL is continuous ) by FUNCT_2:def 1;
hence ( ['x0,(k / (n + 1))'] c= dom (const r) & (const r) | ['x0,(k / (n + 1))'] is continuous & const r is_integrable_on ['x0,(k / (n + 1))'] & (const r) | ['x0,(k / (n + 1))'] is bounded ) by A4, A5, INTEGRA7:19; :: thesis: verum