fact: Definition lookup_step fi (bounds : list I.type) i output cont := if I.subset (fi bounds) output then output else let bounds' := change_nth i bounds (fun xi => fst (I.bisect xi)) in let output := cont bounds' output in if I.lower_bounded output || I.upper_bounded output then let bounds' := change_nth i bounds (fun xi => snd (I.bisect xi)) in cont bounds' output else output.
imports: Coq(Bool Reals) Flocq(Zaux Raux) Coq(List) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect) Stdlib Coquelicot Xreal Xreal_derive Basic Interval Interval_compl Taylor_model Tree Prog