proposition: Lemma polyseq1 : (1 : {poly R}) = [:: 1] :> seq R.
proof: Proof. by rewrite polyseqC oner_neq0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype bigop finset tuple) mathcomp(div ssralg countalg binomial)