proposition: Lemma set_heap_contract : ∀ s ℓ v v', set_heap (set_heap s ℓ v) ℓ v' = set_heap s ℓ v'.
proof: Proof. intros s ℓ v v'. apply heap_ext. destruct s as [h vh]. simpl. apply setmxx. 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)