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