Theorems · Theorem · order theory
List.Pairwise.sortedLT
∀ {α : Type u_1} {l : List α} [inst : Preorder α], List.Pairwise (fun x1 x2 => x1 < x2) l → l.SortedLTAlias of the reverse direction of List.sortedLT_iff_pairwise.
- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Preorder
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.
- Preorderstatement and proof · cited by 7,952
- List.SortedLTstatement · cited by 66
- List.sortedLT_iff_pairwiseproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- List.sortedLT_range'proof · cited by 2
- List.exists_map_eq_of_sorted_nonempty_iff_sbtwproof · cited by 1
- List.sortedLT_rangeproof · cited by 1
- Nat.sortedLT_map_fst_divisorsAntidiagonalListproof · cited by 0