AFTD Auto-Formalizing Theoretical Domains

Space.sum_apply

theoremverifiedformalizationimported Lean

Space.sum_apply

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
@[simp]
lemma Space.sum_apply {ι : Type} [Fintype ι] (f : ι → Space d) (i : Fin d) :
    (∑ x, f x) i = ∑ x, f x i
Formalizes
Physlib, `Space.sum_apply`
Lean proof
By 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
Built on 55
Used by 54

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in@[simp]lemma Space.sum_apply {ι : Type} [Fintype ι] (f : ι → Space d) (i : Fin d) :    (∑ x, f x) i = ∑ x, f x i := by  let P (ι : Type) [Fintype ι] : Prop := ∀ (f : ι → Space d) (i : Fin d), (∑ x, f x) i = ∑ x, f x i  have h1 : P ι := by    apply Fintype.induction_empty_option    · intro α β h e h f i      rw [← @e.sum_comp _, h, ← @e.sum_comp _]    · simp [P]    · intro α _ h f i      simp only [Fintype.sum_option, add_apply, add_right_inj]      rw [h]  exact h1 f i
See it in the graphDiscuss this resultChallenge it