Mathlib Map

Theorems · Theorem · combinatorics

Multiset.toEnumFinset_filter_eq

∀ {α : Type u_1} [inst : DecidableEq α] (m : Multiset α) (a : α),
  {x ∈ m.toEnumFinset | x.1 = a} = {a} ×ˢ Finset.range (Multiset.count a m)
Defined in
Mathlib.Data.Multiset.Fintype
Cited by
1 results in Mathlib
Foundations
Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Multiset.map_toEnumFinset_fst · cited by 7Multiset.map_toEnumFinset…Finset · cited by 13712FinsetMultiset · cited by 2627MultisetSProd.sprod · cited by 1750SProd.sprodFinset.range · cited by 1341Finset.rangeFinset.filter · cited by 949Finset.filterFinset.ext · cited by 565Finset.extMultiset.count · cited by 302Multiset.countMultiset.toEnumFinset · cited by 24Multiset.toEnumFinsetFinset.singleton_product · cited by 8Finset.singleton_productMultiset.toEnumFinset_filter_…CITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.