Cslib.Algorithms.Lean.TimeM.MinOfList
abbrevimported Lean
x is a minimum element of list l if x ≤ b for all b ∈ l.
Statement
set_option relaxedAutoImplicit true in set_option autoImplicit false in variable {α : Type} [LinearOrder α] in open List in abbrev Cslib.Algorithms.Lean.TimeM.MinOfList (x : α) (l : List α) : Prop
- Defined in
- CSLib, `Cslib.Algorithms.Lean.TimeM.MinOfList`
- 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.MinOfList← Cslib.Algorithms.Lean.TimeM.MinOfList (Cslib/Algorithms/Lean/MergeSort/MergeSort.lean:75): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option relaxedAutoImplicit true in set_option autoImplicit false in variable {α : Type} [LinearOrder α] in open List in /-- `x` is a minimum element of list `l` if `x ≤ b` for all `b ∈ l`. -/ abbrev Cslib.Algorithms.Lean.TimeM.MinOfList (x : α) (l : List α) : Prop := ∀ b ∈ l, x ≤ b