proposition: Lemma primitive0 : forall p, primitive p -> p != 0.
proof: Proof. rewrite /primitive=> p; apply: contraL => /eqP->. by rewrite gcdsr0 eqd_def dvd0r negb_and oner_neq0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(path choice fintype tuple finset ssralg) mathcomp(matrix poly) mathcomp(bigop polydiv) CoqEAL(stronglydiscrete dvdring)