AFTD Auto-Formalizing Theoretical Domains

fderiv_uncurry_comp_fst

theoremverifiedformalizationimported Lean

fderiv_uncurry_comp_fst

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {𝕜 : Type*} [NontriviallyNormedField 𝕜]
    {X Y Z : Type*} [NormedAddCommGroup X] [NormedSpace 𝕜 X]
    [NormedAddCommGroup Y] [NormedSpace 𝕜 Y]
    [NormedAddCommGroup Z] [NormedSpace 𝕜 Z] in
lemma fderiv_uncurry_comp_fst (f : X → Y → Z) (y : Y) (hf : Differentiable 𝕜 (↿f)) :
    fderiv 𝕜 (fun x' => (↿f) (x', y))
    =
    fun x => (fderiv 𝕜 (↿f) ((·, y) x)).comp (fderiv 𝕜 (·, y) x)
Formalizes
Physlib, `fderiv_uncurry_comp_fst`
Lean proof
By Zhi Kai Pong, Tomáš Skřivan, Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {𝕜 : Type*} [NontriviallyNormedField 𝕜]    {X Y Z : Type*} [NormedAddCommGroup X] [NormedSpace 𝕜 X]    [NormedAddCommGroup Y] [NormedSpace 𝕜 Y]    [NormedAddCommGroup Z] [NormedSpace 𝕜 Z] inlemma fderiv_uncurry_comp_fst (f : X → Y → Z) (y : Y) (hf : Differentiable 𝕜 (↿f)) :    fderiv 𝕜 (fun x' => (↿f) (x', y))    =    fun x => (fderiv 𝕜 (↿f) ((·, y) x)).comp (fderiv 𝕜 (·, y) x) := by  have hl (y : Y) : (fun x' => (↿f) (x', y)) = ↿f ∘ (·, y) := by    rfl  rw [hl]  funext x  rw [fderiv_comp]  · fun_prop  · fun_prop
See it in the graphDiscuss this resultChallenge it