AFTD Auto-Formalizing Theoretical Domains

persuasion_slice_card_filter

lemmaverified

Counting coordinates of the slice prior with a property of the underlying m-subset is counting m-subsets of Fin (2m+1) with that property.

Statement

open Finset in
lemma persuasion_slice_card_filter (m : ℕ) (P : Finset (Fin (2 * m + 1)) → Prop)
    [DecidablePred P] :
    (Finset.univ.filter (fun i : persuasion_slice_coord m => P i.1)).card =
      ((powersetCard m Finset.univ).filter P).card
Source
step towards persuasion_receiver_ratio_optimal_constant (optimal receiver-utility constant 3/2, open in arXiv:2606.22226 v1, Sec. 5)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 3

Lean source view module on GitHub

open Finset in/-- Counting coordinates of the slice prior with a property of the underlying `m`-subset is counting `m`-subsets of `Fin (2m+1)` with that property. -/lemma persuasion_slice_card_filter (m : ℕ) (P : Finset (Fin (2 * m + 1)) → Prop)    [DecidablePred P] :    (Finset.univ.filter (fun i : persuasion_slice_coord m => P i.1)).card =      ((powersetCard m Finset.univ).filter P).card := by  rw [← card_map (Function.Embedding.subtype _)]  congr 1  ext x  simp only [mem_map, Finset.mem_filter, Finset.mem_univ, true_and, Function.Embedding.coe_subtype,    mem_powersetCard, Finset.subset_univ]  constructor  · rintro ⟨i, hi, rfl⟩; exact ⟨i.2, hi⟩  · rintro ⟨hx, hP⟩; exact ⟨⟨x, hx⟩, hP, rfl⟩
See it in the graphDiscuss this resultChallenge it