Theorems · Theorem · combinatorics
Multiset.mem_toFinset
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, a ∈ s.toFinset ↔ a ∈ s- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 39 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.
- Finsetstatement · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- Multiset.toFinsetstatement · cited by 230
- Multiset.mem_dedupproof · cited by 5
Cited by39
Results whose statement or proof uses this declaration.
- mem_primitiveRootsproof · cited by 18
- Polynomial.mem_rootSet'proof · cited by 8
- Polynomial.mem_nthRootsFinsetproof · cited by 6
- DFinsupp.mem_support_toFunproof · cited by 6
- DFinsupp.support_mk_subsetproof · cited by 4
- Finset.val_toFinsetproof · cited by 3
- Polynomial.card_roots_toFinset_le_card_roots_derivative_sdiff_roots_succproof · cited by 3
- NumberField.Embeddings.coeff_bdd_of_norm_leproof · cited by 3
- Polynomial.norm_coeff_le_choose_mul_mahlerMeasureproof · cited by 3
- Polynomial.zero_of_eval_zeroproof · cited by 2
- FiniteField.roots_X_pow_card_sub_Xproof · cited by 2
- AlgHom.natCard_of_powerBasisproof · cited by 2