proposition: Lemma eq_enum (A B : {pred T}) : A =i B -> enum A = enum B.
proof: Proof. by move=> /eq_enum->. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)