@@ -24,7 +24,6 @@ Set Implicit Arguments.
2424Unset Strict Implicit .
2525Unset Printing Implicit Defensive.
2626Import Order.TTheory GRing.Theory Num.Def Num.Theory.
27- Import numFieldTopology.Exports.
2827Import numFieldNormedType.Exports.
2928
3029Local Open Scope classical_set_scope.
@@ -39,7 +38,7 @@ Implicit Types (f : R -> R) (a : itv_bound R).
3938Let FTC0 f a : mu.-integrable setT (EFin \o f) ->
4039 let F x := (\int[mu]_(t in [set` Interval a (BRight x)]) f t)%R in
4140 forall x, a < BRight x -> lebesgue_pt f x ->
42- h^-1 *: (F (h + x) - F x) @[h --> (0:R) %R^'] --> f x.
41+ h^-1 *: (F (h + x) - F x) @[h --> 0 %R^'] --> f x.
4342Proof .
4443move=> intf F x ax fx.
4544have locf : locally_integrable setT f.
@@ -191,7 +190,7 @@ Let FTC0_restrict f a x (u : R) : (x < u)%R ->
191190 mu.-integrable [set` Interval a (BRight u)] (EFin \o f) ->
192191 let F y := (\int[mu]_(t in [set` Interval a (BRight y)]) f t)%R in
193192 a < BRight x -> lebesgue_pt f x ->
194- h^-1 *: (F (h + x) - F x) @[h --> ((0:R) %R^')] --> f x.
193+ h^-1 *: (F (h + x) - F x) @[h --> (0 %R^')] --> f x.
195194Proof .
196195move=> xu + F ax fx.
197196rewrite integrable_mkcond//= (restrict_EFin f) => intf.
@@ -354,7 +353,7 @@ Unshelve. all: by end_near. Qed.
354353
355354Lemma parameterized_integral_cvg_left a b (f : R -> R) : a < b ->
356355 mu.-integrable `[a, b] (EFin \o f) ->
357- int a x f @[x --> a] --> (0:R) .
356+ int a x f @[x --> a] --> 0 .
358357Proof .
359358move=> ab intf; pose fab := f \_ `[a, b].
360359have intfab : mu.-integrable `[a, b] (EFin \o fab).
0 commit comments