Theorems · Theorem · order theory
List.sortedLT_iff_nodup_and_sortedLE
∀ {α : Type u_1} {l : List α} [inst : PartialOrder α], l.SortedLT ↔ l.Nodup ∧ l.SortedLE- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- List.SortedLTstatement and proof · cited by 66
- List.SortedLEstatement and proof · cited by 57
- List.SortedLT.nodupproof · cited by 5
- List.SortedLT.sortedLEproof · cited by 3
- List.SortedLE.sortedLT_of_nodupproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.