proposition: Lemma inversion_valid_sampler : ∀ {A op k}, @valid_code A (sampler op k) → ∀ v, valid_code (k v).
proof: Proof. intros A op k h. dependent destruction h. auto. 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)