Cslib.Algorithms.Lean.TimeM.IsSorted
abbrevimported Lean
A list is sorted if it satisfies the Pairwise (· ≤ ·) predicate.
Statement
set_option relaxedAutoImplicit true in set_option autoImplicit false in variable {α : Type} [LinearOrder α] in open List in abbrev Cslib.Algorithms.Lean.TimeM.IsSorted (l : List α) : Prop
- Defined in
- CSLib, `Cslib.Algorithms.Lean.TimeM.IsSorted`
- Lean proof
- By Sorrachai Yingchareonthawornhcai, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Algorithms.Lean.TimeM.IsSorted← Cslib.Algorithms.Lean.TimeM.IsSorted (Cslib/Algorithms/Lean/MergeSort/MergeSort.lean:72): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 3
- Cslib.Algorithms.Lean.TimeM.mergeSort_sortedCslib.Algorithms.Lean.TimeM.mergeSort_sorted
- Cslib.Algorithms.Lean.TimeM.mergeSort_correctMergeSort is functionally correct.
- Cslib.Algorithms.Lean.TimeM.sorted_mergeCslib.Algorithms.Lean.TimeM.sorted_merge
Lean source view module on GitHub
set_option relaxedAutoImplicit true in set_option autoImplicit false in variable {α : Type} [LinearOrder α] in open List in /-- A list is sorted if it satisfies the `Pairwise (· ≤ ·)` predicate. -/ abbrev Cslib.Algorithms.Lean.TimeM.IsSorted (l : List α) : Prop := List.Pairwise (· ≤ ·) l