AFTD Auto-Formalizing Theoretical Domains

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.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 26

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it