Mathlib Map

Theorems · Theorem · combinatorics

Finsupp.count_toMultiset

∀ {α : Type u_1} [inst : DecidableEq α] (f : α →₀ ℕ) (a : α), Multiset.count a (Finsupp.toMultiset f) = f a
Defined in
Mathlib.Data.Finsupp.Multiset
Cited by
10 results in Mathlib
Foundations
Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq

Around this declaration

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

Cites18

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

Cited by10

Results whose statement or proof uses this declaration.