proposition: Lemma enum_fset0 (T : choiceType) : enum (fset0 : finType) = [::] :> seq (@fset0 T).
proof: Proof. by rewrite enumT unlock. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)