fact: Definition bisect prec n midp fi (check : I.type -> bool) := let i := fi IBu IBv in if check i then i else let p := iter_until n (split_piece prec midp fi) (fun '(_, p) => (sum prec p, p)) (fun '(p, _) => check p) (i, PTsome (Piece IBu IBv i) nil) in sum prec (snd p).
imports: Coq(BinPos Reals List) Coquelicot(Coquelicot) Coquelicot Xreal Interval Priority