proposition: Lemma mem_enum A : enum A =i A.
proof: Proof. by move=> x; rewrite mem_filter andbC -has_pred1 has_count enumP. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(path div)