proposition: Theorem ComputeBound_correct : forall prec pi p, pi >:: p -> J.extension (PolR.horner tt p) (ComputeBound prec pi).
proof: Proof. move=> Hfifx X x Hx; rewrite /ComputeBound. by move=> *; apply Pol.horner_correct. Qed.
imports: Coq(ZArith Reals Psatz) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Interval MathComp Datatypes