Theorems · Theorem · combinatorics
List.dedup_cons_of_mem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {l : List α}, a ∈ l → (a :: l).dedup = l.dedup- Defined in
- Mathlib.Data.List.Dedup
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 20 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.
- List.dedupstatement · cited by 47
- List.mem_dedupproof · cited by 7
- List.dedup_cons_of_mem'proof · cited by 3
Cited by9
Results whose statement or proof uses this declaration.
- List.toFinset_consproof · cited by 8
- Multiset.dedup_cons_of_memproof · cited by 4
- List.Disjoint.union_eqproof · cited by 2
- List.dedup_map_of_injectiveproof · cited by 2
- List.sum_map_count_dedup_filter_eq_countPproof · cited by 2
- List.dedup_sym2proof · cited by 1
- List.dedup_eq_nilproof · cited by 0
- List.headI_dedupproof · cited by 0
- List.tail_dedupproof · cited by 0