proposition: Lemma next_mod0p q : next_mod 0 q = 0.
proof: Proof. by rewrite /next_mod rmod0p scaler0. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice path fintype) mathcomp(div bigop order ssralg poly polydiv ssrnum perm zmodp ssrint) mathcomp(polyorder polyrcf interval matrix mxtens)