proposition: Lemma polySpred p : p != 0 -> size p = (size p).-1.+1.
proof: Proof. by rewrite -size_poly_eq0 -lt0n => /prednK. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype bigop finset tuple) mathcomp(div ssralg countalg binomial)