AFTD Auto-Formalizing Theoretical Domains

IsTestFunction.prodMk

theoremverifiedformalizationimported Lean

IsTestFunction.prodMk

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Module in
variable
  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]
  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]
  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] in
open ContDiff InnerProductSpace MeasureTheory in
@[fun_prop]
lemma IsTestFunction.prodMk {f : X → U} {g : X → V'}
    (hf : IsTestFunction f) (hg : IsTestFunction g) :
    IsTestFunction (fun x => (f x, g x))
Formalizes
Physlib, `IsTestFunction.prodMk`
Lean proof
By Tomas Skrivan, Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Tomas Skrivan. 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.
What was changed in IsTestFunction.prodMk
--- Physlib/Mathematics/VariationalCalculus/IsTestFunction.lean:105 (IsTestFunction.prodMk)
+++ as compiled here
@@ -1,3 +1,11 @@
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Module in
+variable
+  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]
+  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]
+  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] in
+open ContDiff InnerProductSpace MeasureTheory in
 @[fun_prop]
-lemma IsTestFunction.prodMk {f : X → U} {g : X → V}
+lemma IsTestFunction.prodMk {f : X → U} {g : X → V'}
     (hf : IsTestFunction f) (hg : IsTestFunction g) :
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Module invariable  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] inopen ContDiff InnerProductSpace MeasureTheory in@[fun_prop]lemma IsTestFunction.prodMk {f : X → U} {g : X → V'}    (hf : IsTestFunction f) (hg : IsTestFunction g) :    IsTestFunction (fun x => (f x, g x)) where  smooth := by fun_prop  supp := by    obtain ⟨Kf, cKf, hKf⟩ := exists_compact_iff_hasCompactSupport.mpr hf.supp    obtain ⟨Kg, cKg, hKg⟩ := exists_compact_iff_hasCompactSupport.mpr hg.supp    refine exists_compact_iff_hasCompactSupport.mp      ⟨Kf ∪ Kg, IsCompact.union cKf cKg, fun x hx => ?_⟩    simp at hx    simp [hKf x hx.1, hKg x hx.2]
See it in the graphDiscuss this resultChallenge it