Above-sign graph set definability
ProvedMonotonicity_Theorem.above_sign_definablegeometry-topologyo-minimality
The set of points in a definable set whose graph value lies strictly above a constant is definable.
Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.above_sign_definable {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B)
(J : Set (Power R 1)) (hJ : M.S 1 J) (c : R) :
M.S 1 (fun y : Power R 1 => J y /\ exists v : Power R 1,
FunctionGraph (R := R) (m := 1) (n := 1) (A := I) (B := B) f.toFun
(Power.append y v) /\
Lt1 D (fun _ => c) v) := by sorrySource
Monotonicity theorem Lemma 2 infrastructure