proposition: Lemma modp_addl_mul_small q r : size r < size d -> (q * d + r) %% d = r.
proof: Proof. by move=> srd; rewrite modpD modp_mull add0r modp_small. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop ssralg poly)