Nonempty coordinate lists have a least element
ProvedMonotonicity_Theorem.exists_least_of_listEvery nonempty list of coordinates has a least element for the dense order: some listed m with every listed r above m or equal to it. This is the entry point to the minimum-preimage construction of the Lemma 1 finite-fiber case.
Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.exists_least_of_list {R : Type} (D : DenseLinearOrderNoEndpoints R)
(L : List R) (hNe : L ≠ []) :
exists m : R, m ∈ L /\ forall r : R, r ∈ L -> (D.lt m r \/ m = r) := by sorrySource
monotonicity.tex, Lemma 1 finite-fiber step; supporting extrema lemma
Read-back
What the Lean code literally says, in plain math · muse-spark
Let be a type, let be a dense linear order with no endpoints on , let be a list of elements of , and assume is not the empty list. Then there exists an element of such that occurs in and, for every element of , if occurs in then either is -less-than or is equal to .
Human review
Confirmed by the mission captain (proposal self-audit).