Definability of one-dimensional value fibers
ProvedMonotonicity_Theorem.definable_value_fiberFor a definable function, each one-dimensional fiber over a value is a definable set.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.definable_value_fiber {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B) (z : Power R 1) :
M.S 1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
(f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Let be an arbitrary type, a dense linear order with no endpoints on , an o-minimal structure over , arbitrary subsets of the -fold power of , an -definable function with domain set and codomain set , and an arbitrary point of the -fold power of ; then it is asserted that the family in arity contains the predicate on in the -fold power of given by and there exists a witness that such that the underlying tuple of the underlying function of evaluated at the paired element equals the constant -tuple whose value at every index is the value of at index , i.e. , with the vacuous/degenerate cases preserved that if the conjunction fails and if is empty the defined set is empty.
Confirmed by the mission captain (proposal self-audit).