proposition: Lemma get_heap_set_heap : ∀ s ℓ ℓ' v, ℓ != ℓ' → get_heap s ℓ = get_heap (set_heap s ℓ' v) ℓ.
proof: Proof. intros s ℓ ℓ' v ne. rewrite get_set_heap_neq. 2: auto. reflexivity. 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)