proposition: Lemma order_modn_coprime k m : 1 < order_modn k m -> coprime k m.
proof: Proof. Proof. by rewrite /order_modn coprime_sym; case: coprime. Qed.
imports: mathcomp(all_ssreflect all_fingroup all_field) mathcomp(ssralg finalg poly polydiv zmodp vector qpoly)