proposition: Lemma valid_bind : ∀ A B c k, ValidCode c → (∀ x, ValidCode (k x)) → ValidCode (@bind A B c k).
proof: Proof. intros A B c k hc hk. induction hc. all: simpl. all: solve [ try constructor ; eauto ]. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssreflect eqtype choice seq ssrfun ssrbool) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd RulesStateProb StateTransformingLaxMorph choice_type) Equations.Prop.DepElim Equations(Equations)