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). Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype tuple) mathcomp(bigop binomial finset finfun zmodp ssralg countalg finalg poly polydiv) mathcomp(perm fingroup) CoqEAL(hrel pos param refinements binnat boolF2 seqpoly poly_op trivial_seq poly_div boolF2)