proposition: Lemma qX_expK i : i < #|qT|.-1 -> qlogp ('qX ^+ i) = i.
proof: Proof. move=> iLF; apply: qX_exp_inj => //; first by apply: qlogp_lt. by rewrite qlogp_qX // expf_eq0 (negPf qX_neq0) andbF. 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)