Theorems · Theorem · order theory
List.sortedGT_ofFn_iff
∀ {α : Type u_1} [inst : Preorder α] {n : ℕ} {f : Fin n → α}, (List.ofFn f).SortedGT ↔ StrictAnti fThe list List.ofFn f is strictly sorted with respect to (· ≥ ·) if and only if f is
strictly antitone.
- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext, Quot.sound
- 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.get_ofFnproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- List.SortedGT.strictAntiproof · cited by 0
- StrictAnti.sortedGT_ofFnproof · cited by 0