Theorems · Theorem · combinatorics
List.dedup_eq_self
∀ {α : Type u_1} [inst : DecidableEq α] {l : List α}, l.dedup = l ↔ l.Nodup- Defined in
- Mathlib.Data.List.Dedup
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses no axioms
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.dedupstatement · cited by 47
Cited by8
Results whose statement or proof uses this declaration.
- Equiv.Perm.cycleType_eqproof · cited by 4
- Finset.noncommProd_toFinsetproof · cited by 2
- List.Nodup.dedupproof · cited by 2
- Equiv.Perm.toList_formPerm_nontrivialproof · cited by 1
- List.formPerm_ext_iffproof · cited by 1
- Finset.support_sum_eqproof · cited by 0
- List.cycleType_formPermproof · cited by 0
- Finset.noncommSum_toFinsetproof · cited by 0