proposition: Lemma horner_cst_creal c x : c%:P.[x] == c%:CR.
proof: Proof. apply: eq_crealP; exists (fun _ => 0%N)=> e i e_gt0 _. by rewrite /= hornerC subrr normr0. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg ssrnum ssrint rat poly polydiv polyorder) mathcomp(perm matrix mxpoly polyXY binomial bigenough)