Theorems · Theorem · combinatorics
List.mem_toFinset
∀ {α : Type u_1} [inst : DecidableEq α] {l : List α} {a : α}, a ∈ l.toFinset ↔ a ∈ l- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 20 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.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- List.toFinsetstatement · cited by 108
- List.mem_dedupproof · cited by 7
Cited by20
Results whose statement or proof uses this declaration.
- List.coe_toFinsetproof · cited by 14
- Ordinal.CNF.coeff_of_notMem_CNFproof · cited by 5
- Finset.sum_list_map_countproof · cited by 3
- Finset.prod_list_map_countproof · cited by 2
- Nat.prod_primeFactors_sdiff_of_squarefreeproof · cited by 1
- Equiv.Perm.IsCycle.existsUnique_cycleproof · cited by 1
- Finset.sum_list_count_of_subsetproof · cited by 1
- Cardinal.exists_notMem_of_length_ltproof · cited by 1
- List.toFinset_range'_1_1proof · cited by 1
- Equiv.Perm.sign_prodCongrRightproof · cited by 1