AFTD Auto-Formalizing Theoretical Domains

FieldStatistic.ofFinset_insert

theoremverifiedformalizationimported Lean

FieldStatistic.ofFinset_insert

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open FieldStatistic in
variable {𝓕 : Type} in
lemma FieldStatistic.ofFinset_insert (q : 𝓕 → FieldStatistic) (φs : List 𝓕) (a : Finset (Fin φs.length))
    (i : Fin φs.length) (h : i ∉ a) :
    ofFinset q φs.get (Insert.insert i a) = (q φs[i]) * ofFinset q φs.get a
Formalizes
Physlib, `FieldStatistic.ofFinset_insert`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 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
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 30
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen FieldStatistic invariable {𝓕 : Type} inlemma FieldStatistic.ofFinset_insert (q : 𝓕 → FieldStatistic) (φs : List 𝓕) (a : Finset (Fin φs.length))    (i : Fin φs.length) (h : i ∉ a) :    ofFinset q φs.get (Insert.insert i a) = (q φs[i]) * ofFinset q φs.get a := by  simp only [ofFinset, Fin.getElem_fin]  rw [← ofList_cons_eq_mul]  have h1 : (φs[↑i] :: List.map φs.get (a.sort (fun x1 x2 => x1 ≤ x2)))      = List.map φs.get (i :: a.sort (fun x1 x2 => x1 ≤ x2)) := by      simp  erw [h1]  apply ofList_perm  refine List.Perm.map φs.get ?_  refine (List.perm_ext_iff_of_nodup ?_ ?_).mpr ?_  · exact (Insert.insert i a).sort_nodup (fun x1 x2 => x1 ≤ x2)  · simp only [List.nodup_cons, Finset.mem_sort, Finset.sort_nodup, and_true]    exact h  intro a  simp
See it in the graphDiscuss this resultChallenge it