proposition: Lemma size_TM_comp (X0 X : I.type) (Tyg : TM_type) (TMf : rpa) (n : nat) : (forall Y0 Y k, 0 < Pol.size (approx (Tyg Y0 Y k))) -> Pol.size (approx (TM_comp Tyg TMf X0 X n)) = n.+1.
proof: Proof. by move=> Hsize; rewrite size_TM_horner ifT // Hsize. Qed.
imports: Coq(ZArith Psatz Reals) Flocq(Raux) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Stdlib MathComp Coquelicot Xreal Interval Basic Xreal_derive Interval_compl Datatypes Taylor_poly Basic_rec Bound