Theorems · Theorem · combinatorics
List.dedup_eq_cons
∀ {α : Type u_1} [inst : DecidableEq α] (l : List α) (a : α) (l' : List α),
l.dedup = a :: l' ↔ a ∈ l ∧ a ∉ l' ∧ l.dedup.tail = l'- Defined in
- Mathlib.Data.List.Dedup
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 51 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.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.dedupstatement and proof · cited by 47
- List.nodup_iff_count_le_oneproof · cited by 9
- List.mem_dedupproof · cited by 7
- List.cons_head!_tailproof · cited by 6
- List.nodup_dedupproof · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.