FieldStatistic.ofFinset_finset_map
theoremverifiedformalizationimported Lean
FieldStatistic.ofFinset_finset_map
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open FieldStatistic in variable {π : Type} in lemma FieldStatistic.ofFinset_finset_map {n m : β} (q : π β FieldStatistic) (i : Fin m β Fin n) (hi : Function.Injective i) (f : Fin n β π) (a : Finset (Fin m)) : ofFinset q (f β i) a = ofFinset q f (a.map β¨i, hiβ©)
- Formalizes
- Physlib, `FieldStatistic.ofFinset_finset_map`
- 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.FieldStatistic.ofFinset_finset_map← FieldStatistic.ofFinset_finset_map (Physlib/QFT/PerturbationTheory/FieldStatistics/OfFinset.lean:38): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 26
- FieldStatistic.fermionic_not_eq_bonsicFieldStatistic.fermionic_not_eq_bonsic
- FieldStatistic.ofList_emptyFieldStatistic.ofList_empty
- FieldStatistic.neq_fermionic_iff_eq_bosonicFieldStatistic.neq_fermionic_iff_eq_bosonic
- FieldStatistic.instCommGroupThe type
FieldStatisticcarries an instance of a commutative group in which -bosonic * bosonic = bosonic-β¦ - FieldStatistic.ofList_freeMonoidFieldStatistic.ofList_freeMonoid
- FieldStatistic.instFintypeField statics form a finite type.
- FieldStatistic.fermionic_ne_iff_bosonic_eqFieldStatistic.fermionic_ne_iff_bosonic_eq
- FieldStatistic.ofList_appendFieldStatistic.ofList_append
- FieldStatistic.fermionic_mul_bosonicFieldStatistic.fermionic_mul_bosonic
- FieldStatisticThe type
FieldStatisticis the type containing two elementsbosonicandfermionic. This type is used to specify if a field or⦠- FieldStatistic.mul_bosonicFieldStatistic.mul_bosonic
- FieldStatistic.ofFinset_emptyFieldStatistic.ofFinset_empty
- FieldStatistic.ofList_permFieldStatistic.ofList_perm
- FieldStatistic.bosonic_ne_iff_fermionic_eqFieldStatistic.bosonic_ne_iff_fermionic_eq
- FieldStatistic.neq_bosonic_iff_eq_fermionicFieldStatistic.neq_bosonic_iff_eq_fermionic
- FieldStatistic.fermionic_mul_fermionicFieldStatistic.fermionic_mul_fermionic
- FieldStatistic.mul_selfFieldStatistic.mul_self
- FieldStatistic.instAddMonoidThe instance of an additive monoid on
FieldStatistic. - FieldStatistic.ofFinsetThe field statistic associated with a map
f : Fin n β π(usually.getof a list) and a finite set of elements ofFin n. - FieldStatistic.ofList_singletonFieldStatistic.ofList_singleton
- FieldStatistic.ofList_insertionSortFieldStatistic.ofList_insertionSort
- FieldStatistic.add_eq_mulFieldStatistic.add_eq_mul
- FieldStatistic.bosonic_mul_bosonicFieldStatistic.bosonic_mul_bosonic
- FieldStatistic.bosonic_mul_fermionicFieldStatistic.bosonic_mul_fermionic
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
β€is total (complete). This is weaker thanLinearOrderβ it does NOT require antisymmetry orβ¦
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen FieldStatistic invariable {π : Type} inlemma FieldStatistic.ofFinset_finset_map {n m : β} (q : π β FieldStatistic) (i : Fin m β Fin n) (hi : Function.Injective i) (f : Fin n β π) (a : Finset (Fin m)) : ofFinset q (f β i) a = ofFinset q f (a.map β¨i, hiβ©) := by simp only [ofFinset] apply FieldStatistic.ofList_perm rw [β List.map_map] refine List.Perm.map f ?_ apply List.perm_of_nodup_nodup_toFinset_eq Β· refine (List.nodup_map_iff_inj_on ?_).mpr ?_ exact a.sort_nodup (fun x1 x2 => x1 β€ x2) simp only [Finset.mem_sort] intro x hx y hy exact fun a => hi a Β· exact (Finset.map { toFun := i, inj' := hi } a).sort_nodup (fun x1 x2 => x1 β€ x2) Β· ext a simp