proposition: Lemma le_def m n : m %| n = (gcdn m n == m)%N.
proof: Proof. by apply/gcdn_idPl/eqP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)