proposition: Lemma enum_ord n : enum 'I_n = fintype.enum 'I_n.
proof: Proof. rewrite (sorted_sort le_trans)// -(@sorted_map _ _ (val : 'I_n -> nat))/=. by rewrite val_enum_ord iota_sorted. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)