Covered left windows have a pure adjacent cut above
ProvedMonotonicity_Theorem.left_adjacent_cutIf two definable sets cover a left window, some cut above the left endpoint yields a pure adjacent subwindow. Strengthens the adjacent-piece selection with the lower bound needed for domain membership of the cut.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.left_adjacent_cut {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {A B : Set (Power R 1)}
(hA : M.S 1 A) (hB : M.S 1 B)
{c1 p : R} (hlt : D.lt c1 p)
(hcov : forall x : Power R 1,
openInterval D (Endpoint.finite c1) (Endpoint.finite p) x -> A x \/ B x) :
exists c1' : R, D.lt c1' p /\ (D.lt c1 c1' \/ c1 = c1') /\
((forall x : Power R 1,
openInterval D (Endpoint.finite c1') (Endpoint.finite p) x -> A x) \/
(forall x : Power R 1,
openInterval D (Endpoint.finite c1') (Endpoint.finite p) x -> B x)) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Let be a type, a dense linear order without endpoints on , an o-minimal structure over , and subsets of the -fold power of such that belongs to the family designated by in dimension and belongs to the family designated by in dimension ; let with , and assume that for every in the -fold power of , if lies in the open interval with finite endpoints and then or ; then there exists such that and ( or ) and (for every in the -fold power of , if lies in the open interval with finite endpoints then , or for every in the -fold power of , if lies in the open interval with finite endpoints then ), where in particular the left endpoint is allowed to stay at and, if no element lies in resp. , the corresponding universal implication holds vacuously, making the covering hypothesis resp. one or both final alternatives vacuously true.
Confirmed by the mission captain (proposal self-audit).