proposition: Lemma eval_ExpPoly e p n : eval_poly e (p ^^+ n)%qfT = (eval_poly e p) ^+ n.
proof: Proof. case: n=> [|n]; first by rewrite /= expr0 mul0r add0r. rewrite /ExpPoly iteropS exprSr; elim: n=> [|n ihn] //=. by rewrite expr0 mul1r. by rewrite eval_MulPoly ihn exprS mulrA. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(finfun path matrix) mathcomp(bigop order ssralg poly polydiv ssrnum zmodp div ssrint) mathcomp(polyorder polyrcf interval polyXY) mathcomp(qe_rcf_th ordered_qelim mxtens)