proposition: Lemma neq0_mods_rec p q : p != 0 -> mods p q = p :: mods q (next_mod p q).
proof: Proof. by rewrite mods_rec => /negPf ->. 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)