Theorems · Definition · combinatorics
List.toFinset
{α : Type u_1} → [DecidableEq α] → List α → Finset αtoFinset l removes duplicates from the list l to produce a finset.
- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 108 results in Mathlib
- Foundations
- Depth 73 from the axioms, rests on 1,340 definitions · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Multiset.ofListproof · cited by 290
- Multiset.toFinsetproof · cited by 230
Cited by116
Results whose statement or proof uses this declaration.
- Nat.primeFactorsproof · cited by 129
- List.mem_toFinsetstatement · cited by 20
- Equiv.Perm.mem_cycleFactorsFinset_iffproof · cited by 17
- List.coe_toFinsetstatement · cited by 14
- Finset.sum_multiset_map_countproof · cited by 10
- AList.lookupFinsuppproof · cited by 9
- List.toFinset_consstatement · cited by 8
- Finset.prod_multiset_map_countproof · cited by 7
- Equiv.Perm.cycleFactorsFinset_eq_finsetproof · cited by 5
- List.card_toFinsetstatement · cited by 5
- List.toFinset_card_of_nodupstatement · cited by 5
- List.support_formPerm_le'statement and proof · cited by 5