Theorems · Theorem · order theory
List.sortedGT_iff_getElem_gt_getElem_of_lt
∀ {α : Type u_1} {l : List α} [inst : Preorder α],
l.SortedGT ↔ ∀ ⦃i j : ℕ⦄ ⦃hi : i < l.length⦄ ⦃hj : j < l.length⦄, j < i → l[i] < l[j]- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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 and proof · cited by 54
- List.SortedGT.strictAnti_getproof · cited by 5
- StrictAnti.sortedGTproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- List.SortedGT.getElem_gt_getElem_of_ltproof · cited by 0
- List.sortedGT_of_getElem_gt_getElem_of_ltproof · cited by 0