proposition: Lemma choice_type_refl : ∀ u, choice_type_eq u u.
proof: Proof. intros u. destruct choice_type_eq eqn:e. - constructor. - move: e => /choice_type_eqP []. reflexivity. Qed.
imports: Coq(Utf8 Lia) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples GenericRulesSimple) mathcomp(ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice reals distr realsum seq all_algebra fintype) Crypt(Prelude Axioms) extructures(ord fset fmap) Mon(SPropBase) Equations(Equations)