Theorems · Theorem · combinatorics
List.mem_dedup
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {l : List α}, a ∈ l.dedup ↔ a ∈ l- Defined in
- Mathlib.Data.List.Dedup
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 19 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.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- not_and_orproof · cited by 82
- List.dedupstatement · cited by 47
Cited by7
Results whose statement or proof uses this declaration.
- List.mem_toFinsetproof · cited by 20
- List.dedup_cons_of_memproof · cited by 9
- List.dedup_cons_of_notMemproof · cited by 9
- Multiset.mem_dedupproof · cited by 5
- List.Disjoint.dedup_appendproof · cited by 3
- List.subset_dedupproof · cited by 1
- List.dedup_eq_consproof · cited by 0