proposition: Lemma big_coef_npoly (p : {poly_n R}) i : n <= i -> p`_i = 0.
proof: Proof. by move=> i_big; rewrite nth_default // (leq_trans _ i_big) ?size_npoly. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice fintype tuple) mathcomp(bigop binomial finset finfun ssralg countalg finalg poly polydiv) mathcomp(perm fingroup matrix mxalgebra mxpoly vector countalg)