proposition: Lemma IDE : ∀ I n, ID I n = omap (λ '(So,To), (So ; To ; λ x, opr (n,(So,To)) x (λ y, ret y))) (getm_def I n).
proof: Proof. intros I n. unfold ID. rewrite mkfmapE. rewrite getm_def_map_dep. reflexivity. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssreflect eqtype choice seq ssrfun ssrbool ssrnat) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd StateTransformingLaxMorph choice_type pkg_core_definition RulesStateProb) Equations(Equations)