proposition: Lemma eval_polyP e p : eval_poly e p = Poly (map (eval e) p).
proof: Proof. by elim: p=> // a p /= ->; rewrite cons_poly_def. 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)