AFTD Auto-Formalizing Theoretical Domains

fderiv_uncurry

theoremverifiedformalizationimported Lean

fderiv_uncurry

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 (f : X → Y → Z) (xy dxy : X × Y)
    (hf : DifferentiableAt 𝕜 (↿f) xy) :
    fderiv 𝕜 ↿f xy dxy
    =
    fderiv 𝕜 (f · xy.2) xy.1 dxy.1 + fderiv 𝕜 (f xy.1 ·) xy.2 dxy.2
Formalizes
Physlib, `fderiv_uncurry`
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
Used by 4

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 (f : X → Y → Z) (xy dxy : X × Y)    (hf : DifferentiableAt 𝕜 (↿f) xy) :    fderiv 𝕜 ↿f xy dxy    =    fderiv 𝕜 (f · xy.2) xy.1 dxy.1 + fderiv 𝕜 (f xy.1 ·) xy.2 dxy.2 := by  have hx : (f · xy.2) = ↿f ∘ (fun x' => (x',xy.2)) := by rfl  have hy : (f xy.1 ·) = ↿f ∘ (fun y' => (xy.1,y')) := by rfl  rw [hx,hy]  repeat rw [fderiv_comp (hg := by fun_prop) (hf := by fun_prop)]  dsimp  rw [← ContinuousLinearMap.map_add]  congr  repeat rw [DifferentiableAt.fderiv_prodMk (hf₁ := by fun_prop) (hf₂ := by fun_prop)]  simp
See it in the graphDiscuss this resultChallenge it