proposition: Lemma lookup_hpv_spec : ∀ ℓ s v l s₀ s₁ h₀ h₁, lookup_hpv ℓ s l = Some v → update_heaps l s₀ s₁ = (h₀, h₁) → get_heap (choose_heap h₀ h₁ s) ℓ = v.
proof: Proof. intros ℓ s v l s₀ s₁ h₀ h₁ hl e. destruct s. - eapply lookup_hpv_l_spec. all: eauto. - eapply lookup_hpv_r_spec. all: eauto. 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)