proposition: Lemma enum_setT : enum [set: T] = sort <=%O (Finite.enum T).
proof: Proof. by rewrite enum_setT. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)