proposition: Lemma size_TM_ln (X0 X : I.type) (n : nat) : Pol.size (approx (TM_ln X0 X n)) = n.+1.
proof: Proof. by rewrite /TM_ln; case: gt0; case: n => [|n] /=; rewrite !sizes ?(@Pol.size_dotmuldiv n.+1, Pol.size_rec1, size_rec1up, size_behead). 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