Theorems · Theorem · order theory
StrictAnti.sortedGT
∀ {α : Type u_1} {l : List α} [inst : Preorder α], StrictAnti l.get → l.SortedGTAlias of the reverse direction of List.sortedGT_iff_strictAnti_get.
- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 27 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
- StrictAntistatement · cited by 204
- List.SortedGTstatement · cited by 54
- List.sortedGT_iff_strictAnti_getproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- List.sortedGT_iff_getElem_gt_getElem_of_ltproof · cited by 2
- List.SortedGE.sortedGT_of_nodupproof · cited by 2