Theorems · Theorem · order theory
List.sortedGT_iff_pairwise
∀ {α : Type u_1} {l : List α} [inst : Preorder α], l.SortedGT ↔ List.Pairwise (fun x1 x2 => x1 > x2) l- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 66 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.
Cites2
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.SortedGTstatement · cited by 54
Cited by3
Results whose statement or proof uses this declaration.
- List.SortedGT.pairwiseproof · cited by 3
- List.sortedGT_iff_isChainproof · cited by 3
- List.Pairwise.sortedGTproof · cited by 1