proposition: Lemma repr_cmd_bind : ∀ {A B} (c : command A) (k : A → raw_code B), repr (cmd_bind c k) = bindrFree (repr_cmd c) (λ a, repr (k a)).
proof: Proof. intros A B c k. destruct c. all: reflexivity. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice reals distr seq all_algebra fintype realsum) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd SubDistr Couplings RulesStateProb UniformStateProb UniformDistrLemmas StateTransfThetaDens StateTransformingLaxMorph choice_type pkg_core_definition pkg_notation pkg_tactics pkg_composition pkg_heap) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)