Theorems · Theorem · order theory
List.SortedGT.getElem_le_getElem_iff
∀ {α : Type u_1} {l : List α} [inst : LinearOrder α],
l.SortedGT → ∀ {i j : ℕ} {hi : i < l.length} {hj : j < l.length}, l[i] ≤ l[j] ↔ j ≤ i- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrder
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.
- LinearOrderstatement and proof · cited by 8,572
- List.SortedGTstatement and proof · cited by 54
- StrictAnti.le_iff_geproof · cited by 16
- List.SortedGT.strictAnti_getproof · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.