proposition: Lemma SDistr_leftneutral : forall (A B : ord_choiceType) (f : TypeCat ⦅ choice_incl A; SDistr_carrier B ⦆), SDistr_bind A B f ∙ SDistr_unit A = f.
proof: Proof. intros A B ff. simpl. simpl in ff. apply boolp.funext. intro de. apply distr_ext. apply dlet_unit. Qed.
imports: Coq(Relation_Definitions Morphisms) mathcomp(all_ssreflect all_algebra distr reals realsum) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) Crypt(ChoiceAsOrd Axioms)