proposition: Lemma get_heap_helper : ∀ h ℓ p, valid_heap h → h ℓ = Some p → ℓ.π1 = p.π1.
proof: Proof. intros h ℓ p vh e. assert (hℓ : exists v, h ℓ = Some v). { eexists. eauto. } move: hℓ => /dommP hℓ. unfold valid_heap in vh. move: vh => /eqP vh. rewrite vh in hℓ. rewrite in_fset_filter in hℓ. move: hℓ => /andP [vℓ hℓ]. unfold valid_location in vℓ. rewrite e in vℓ. unfold check_loc_val in vℓ. move: vℓ => /eqP. 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) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)