# Question 10151: Derivative of an Oriented Integral with Moving Bounds [Return to catalogue page 51](https://ocme.evemisslab.com/en/questions/page/51/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261007-advance-20261009-r01-fundamental-theorem-calculus-foundations/#q-20261007-advance-20261009-r01-fundamental-theorem-calculus-0026) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0019-10151 · q-20261007-advance-20261009-r01-fundamental-theorem-calculus-0026 ## Original question and givens On all R, continuous f has ascending coefficients [1], constant term first. Let lower l(x)=(1)x+(0) and upper u(x)=(2)x+(0). Find the derivative of ∫_l(x)^u(x) f(t)dt at x=0. Use reduced positive-denominator fractions, retaining /1 for integers. - G001 — On all R, continuous f has ascending coefficients [1], constant term first. Let lower l(x)=(1)x+(0) and upper u(x)=(2)x+(0). Find the derivative of ∫_l(x)^u(x) f(t)dt at x=0. Use reduced positive-denominator fractions, retaining /1 for integers. ## Definition and scope Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate. - [mko-fundamental-theorem-calculus](https://ocme.evemisslab.com/en/mko/mko-fundamental-theorem-calculus/) ## Step-by-step derivation S001 · impliesBefore raw integrand f=[1];ascending powers on all R After normalized coefficients=[1/1];declared continuous real polynomial Conditions: none The declared integrand is a continuous real polynomial on all R,and endpoints are oriented.Use FTC only under these supplied sufficient hypotheses;finite checks are not a new general formal FTC proof. Step identifiers and dependenciesRule: declared_FTC_continuity_hypothesis · Uses: G001 S002 · calculationBefore zero primitive coefficient1 := div(1, 1) After zero primitive coefficient1 = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S001 S003 · impliesBefore integrand power=0;coefficient=1/1 After primitive power=1;coefficient=1/1 Conditions: none For c*x^k place c/(k+1) at x^(k+1),with positive denominator k+1.Differentiating recovers c*x^k.Any additive constant gives another primitive. Step identifiers and dependenciesRule: polynomial_primitive_coefficient_rule · Uses: G001, S002 S004 · impliesBefore original integrand coefficients=[1/1] After zero-constant primitive coefficients=[0/1, 1/1] Conditions: none This is one convenient representative,not a claim that the primitive is unique without its constant family. Step identifiers and dependenciesRule: zero_constant_polynomial_primitive · Uses: G001, S003 S005 · calculationBefore constructed P0 derivative coefficient0 := mul(1, 1) After constructed P0 derivative coefficient0 = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S004 S006 · impliesBefore constructed P0:source power=1;coefficient=1/1 After derivative power=0;coefficient=1/1 Conditions: none Multiply the coefficient by k and lower its power by1.The constant contributes nothing;retain every higher nonzero term. Step identifiers and dependenciesRule: polynomial_derivative_coefficient_rule · Uses: G001, S005 S007 · impliesBefore P0 derivative coefficients=[1/1];f=[1/1] After P0'=f on all R in this declared polynomial model Conditions: none The full coefficient identity establishes the primitive relation in the declared model.With the supplied continuity premise use the FTC endpoint difference,not a function guessed from sample points. Step identifiers and dependenciesRule: constructed_primitive_coefficient_identity · Uses: G001, S006 S008 · calculationBefore lower bound m*x := mul(1, 0) After lower bound m*x = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S007 S009 · calculationBefore lower bound m*x+b := sum(0, 0) After lower bound m*x+b = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S008 S010 · calculationBefore upper bound m*x := mul(2, 0) After upper bound m*x = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S009 S011 · calculationBefore upper bound m*x+b := sum(0, 0) After upper bound m*x+b = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S010 S012 · impliesBefore H(x)=P0(u(x))-P0(l(x));P0'=f;lower slope=1;upper slope=2 After H'(x)=f(u(x))*upper_slope-f(l(x))*lower_slope Conditions: none Use the oriented endpoint difference,then the chain rule for both compositions.Subtract the whole lower-bound term;constant bounds have slope0.Equal bound values at one point do not mean equal velocities or force a zero derivative. Step identifiers and dependenciesRule: FTC_moving_bounds_two_chain_factors · Uses: G001, S011 S013 · calculationBefore f at upper Horner multiply0 := mul(0, 0) After f at upper Horner multiply0 = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S012 S014 · calculationBefore f at upper Horner add0 := sum(0, 1) After f at upper Horner add0 = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S013 S015 · calculationBefore f at lower Horner multiply0 := mul(0, 0) After f at lower Horner multiply0 = 0 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S014 S016 · calculationBefore f at lower Horner add0 := sum(0, 1) After f at lower Horner add0 = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S015 S017 · calculationBefore upper chain contribution := mul(1, 2) After upper chain contribution = 2 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S016 S018 · calculationBefore lower chain contribution := mul(1, 1) After lower chain contribution = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S017 S019 · calculationBefore moving bound derivative upper-minus-lower := sub(2, 1) After moving bound derivative upper-minus-lower = 1 Conditions: none Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S018 S020 · impliesBefore point=0;lower=0;upper=0;f(upper)=1;f(lower)=1 After upper contribution=2;lower contribution=1;derivative=1/1 Conditions: none Retain both actual endpoints,integrand values and slopes,then subtract with sign.Do not take an absolute area or discard zero/negative velocities. Step identifiers and dependenciesRule: FTC_moving_bounds_actual_values · Uses: G001, S019 ## Reverse checks - S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S019 · premise_and_result_audit — Recompute moving bound derivative upper-minus-lower with exact rational arithmetic, not rounded decimals. - S018 · premise_and_result_audit — Recompute lower chain contribution with exact rational arithmetic, not rounded decimals. - S017 · premise_and_result_audit — Recompute upper chain contribution with exact rational arithmetic, not rounded decimals. - S016 · premise_and_result_audit — Recompute f at lower Horner add0 with exact rational arithmetic, not rounded decimals. - S015 · premise_and_result_audit — Recompute f at lower Horner multiply0 with exact rational arithmetic, not rounded decimals. - S014 · premise_and_result_audit — Recompute f at upper Horner add0 with exact rational arithmetic, not rounded decimals. - S013 · premise_and_result_audit — Recompute f at upper Horner multiply0 with exact rational arithmetic, not rounded decimals. - S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S011 · premise_and_result_audit — Recompute upper bound m*x+b with exact rational arithmetic, not rounded decimals. - S010 · premise_and_result_audit — Recompute upper bound m*x with exact rational arithmetic, not rounded decimals. - S009 · premise_and_result_audit — Recompute lower bound m*x+b with exact rational arithmetic, not rounded decimals. - S008 · premise_and_result_audit — Recompute lower bound m*x with exact rational arithmetic, not rounded decimals. - S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S005 · premise_and_result_audit — Recompute constructed P0 derivative coefficient0 with exact rational arithmetic, not rounded decimals. - S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S002 · premise_and_result_audit — Recompute zero primitive coefficient1 with exact rational arithmetic, not rounded decimals. - S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. ## Result 1/1 The full substitutions and premise checks give the original answer; source identity,format and status are unchanged. ## This question review and source binding Review date: 2026-10-26 Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: f9f68e27cce2ef8c1f508f318e6967a8245c031790ff00305f5e760dd93a0ddd - candidate record SHA-256: 0dcb5a7fd1aca114f57937db9585e46930d97168651de119140d8e1f78437e8a - semantic review receipt SHA-256: eeb35dc5daab92234bf72827627392b47f38ead4cfb574d4373bebc43c09fbf5 - question-first witness SHA-256: 3cf8e0d3a00b0df1994db2bfde81f4a31b382e170bdda83ea3d0b68da64e8419 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261007-advance-20261009-r01-fundamental-theorem-calculus-0026.json)