Theorems · Theorem · combinatorics
Finsupp.toMultiset_eq_iff
∀ {α : Type u_1} [inst : DecidableEq α] {f : α →₀ ℕ} {s : Multiset α},
Finsupp.toMultiset f = s ↔ f = Multiset.toFinsupp s- Defined in
- Mathlib.Data.Finsupp.Multiset
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 82 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsuppstatement and proof · cited by 5,255
- AddMonoidHomstatement · cited by 3,230
- Multisetstatement and proof · cited by 2,627
- AddEquivstatement · cited by 1,087
- Finsupp.toMultisetstatement · cited by 44
- Multiset.toFinsuppstatement and proof · cited by 33
- AddEquiv.symm_apply_eqproof · cited by 8
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.