proposition: Lemma inversion_valid_putr : ∀ {A l v k}, @valid_code A (putr l v k) → (l \in Loc) * (valid_code k).
proof: Proof. intros A l v k h. dependent destruction h. intuition 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)