proposition: Lemma enum_uniq (A : {pred T}) : uniq (enum A).
proof: Proof. by rewrite sort_uniq enum_uniq. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)