Theorems · Theorem · global analysis

HasFDerivWithinAt.congr

∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] {E : Type u_2} [inst_1 : AddCommGroup E] [inst_2 : Module 𝕜 E]
  [inst_3 : TopologicalSpace E] {F : Type u_3} [inst_4 : AddCommGroup F] [inst_5 : Module 𝕜 F]
  [inst_6 : TopologicalSpace F] {f f₁ : E → F} {f' : E →L[𝕜] F} {x : E} {s : Set E},
  HasFDerivWithinAt f f' s x → Set.EqOn f₁ f s → f₁ x = f x → HasFDerivWithinAt f₁ f' s x

Defined in

Mathlib.Analysis.Calculus.FDeriv.Congr

Cited by

6 results in Mathlib

Foundations

Depth 167 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NontriviallyNormedFieldAddCommGroupModuleTopologicalSpaceAddCommGroupModuleTopologicalSpace