Covered right windows have a pure adjacent cut below
ProvedMonotonicity_Theorem.right_adjacent_cutIf two definable sets cover a right window, some cut below the right endpoint yields a pure adjacent subwindow. Mirror of the bounded left-sided selection step of Lemma 2.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.right_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)
{p c2 : R} (hlt : D.lt p c2)
(hcov : forall x : Power R 1,
openInterval D (Endpoint.finite p) (Endpoint.finite c2) x -> A x \/ B x) :
exists m : R, D.lt p m /\ (D.lt m c2 \/ m = c2) /\
((forall x : Power R 1,
openInterval D (Endpoint.finite p) (Endpoint.finite m) x -> A x) \/
(forall x : Power R 1,
openInterval D (Endpoint.finite p) (Endpoint.finite m) x -> B x)) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Fix a type equipped with a dense linear order without endpoints and an o-minimal structure over ; let and be subsets of the -fold power of such that belongs to the distinguished family of in dimension and belongs to the distinguished family of in dimension ; let with ; 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 either every in the open interval with finite endpoints and lies in or every in the open interval with finite endpoints and lies in .
Confirmed by the mission captain (proposal self-audit).