proposition: Lemma pnat_dvd m n pi : m %| n -> pi.-nat n -> pi.-nat m.
proof: Proof. by case/dvdnP=> q ->; rewrite pnatM; case/andP. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(fintype div bigop)