proposition: Lemma option_enumP : Finite.axiom option_enum.
proof: Proof. by case=> [x|]; rewrite /= count_map (count_pred0, enumP). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(path div)