Theorems · Theorem · combinatorics
Multiset.toFinset_eq
∀ {α : Type u_1} [inst : DecidableEq α] {s : Multiset α} (n : s.Nodup), { val := s, nodup := n } = s.toFinset- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 6 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.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- Multiset.toFinsetstatement · cited by 230
- Multiset.Nodupstatement and proof · cited by 148
- Multiset.Nodup.dedupproof · cited by 15
- Finset.val_injproof · cited by 9
Cited by6
Results whose statement or proof uses this declaration.
- List.toFinset_eqproof · cited by 2
- Polynomial.X_pow_sub_one_eq_prodproof · cited by 1
- IsPrimitiveRoot.card_nthRootsFinsetproof · cited by 1
- Multiset.Nodup.toFinset_injproof · cited by 1
- Equiv.Perm.cycleFactorsFinset_eq_list_toFinsetproof · cited by 1
- Polynomial.exists_finset_of_splitsproof · cited by 0