Theorems · Theorem · combinatorics
List.duplicate_iff_two_le_count
∀ {α : Type u_1} {l : List α} {x : α} [inst : DecidableEq α], List.Duplicate x l ↔ 2 ≤ List.count x l- Defined in
- Mathlib.Data.List.Duplicate
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 21 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.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.Duplicatestatement · cited by 24
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Connected.induce_compl_singleton_of_degree_eq_oneproof · cited by 1
- List.duplicate_iff_exists_distinct_getproof · cited by 0