Theorems · Theorem · order theory
List.SortedLT.strictMono_get
∀ {α : Type u_1} {l : List α} [inst : Preorder α], l.SortedLT → StrictMono l.getAlias of the forward direction of List.sortedLT_iff_strictMono_get.
- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 5 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
- StrictMonostatement · cited by 706
- List.SortedLTstatement · cited by 66
- List.sortedLT_iff_strictMono_getproof · cited by 2
Cited by5
Results whose statement or proof uses this declaration.
- List.SortedLT.nodupproof · cited by 5
- List.SortedLT.sortedLEproof · cited by 3
- List.sortedLT_iff_getElem_lt_getElem_of_ltproof · cited by 2
- List.SortedLT.getElem_le_getElem_iffproof · cited by 0
- List.SortedLT.getElem_lt_getElem_iffproof · cited by 0