proposition: Lemma qX_neq0 : 'qX != 0 :> qT.
proof: Proof. apply/eqP => /val_eqP/=. by rewrite [rmodp _ _]qpolyXE ?polyX_eq0 //; case: primitive_mi. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice fintype tuple) mathcomp(div bigop binomial finset finfun ssralg countalg finalg) mathcomp(poly polydiv qpoly perm fingroup falgebra fieldext finfield galois) mathcomp(finalg zmodp matrix vector)