proposition: Lemma enum_finpredE (T : eqType) (fpT : finpredType T) (p : fpT) : enum_finpred p =i p.
proof: Proof. by case: fpT p => ?? [s sE] p x; rewrite sE -topredE. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)