proposition: Lemma changes_mods0p q : changes_mods 0 q = 0.
proof: Proof. by rewrite /changes_mods /changes_poly mods0p. 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)