proposition: Lemma restore_set_rhs : ∀ ℓ v pre s₀ s₁, set_rhs ℓ v pre (s₀, s₁) → (∀ s₁', pre (s₀, s₁') → pre (s₀, set_heap s₁' ℓ v)) → pre (s₀, s₁).
proof: Proof. intros ℓ v pre s₀ s₁ h hpre. destruct h as [? [? ?]]. subst. eapply hpre. auto. 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 pkg_semantics pkg_lookup pkg_advantage) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)