Theorems · Theorem · combinatorics
Multiset.toFinset_val
∀ {α : Type u_1} [inst : DecidableEq α] (s : Multiset α), s.toFinset.val = s.dedup- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 73 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.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Finset.valstatement · cited by 438
- Multiset.toFinsetstatement · cited by 230
- Multiset.dedupstatement · cited by 59
Cited by8
Results whose statement or proof uses this declaration.
- UniqueFactorizationMonoid.radical_dvd_selfproof · cited by 7
- FiniteField.roots_X_pow_card_sub_Xproof · cited by 2
- UniqueFactorizationMonoid.primeFactors_val_eq_normalizedFactorsproof · cited by 1
- Algebra.norm_eq_prod_embeddings_genproof · cited by 1
- trace_eq_sum_embeddings_genproof · cited by 1
- Nat.divisors_filter_squarefreeproof · cited by 1
- List.foldr_sup_eq_sup_toFinsetproof · cited by 1
- List.foldr_inf_eq_inf_toFinsetproof · cited by 0