proposition: Lemma put_pre_cond_heap_ignore : ∀ ℓ v L, put_pre_cond ℓ v (heap_ignore L).
proof: Proof. intros ℓ v L s₀ s₁ h ℓ' hn. destruct (ℓ' != ℓ) eqn:e. - rewrite get_set_heap_neq. 2: auto. rewrite get_set_heap_neq. 2: auto. apply h. auto. - move: e => /eqP e. subst. rewrite !get_set_heap_eq. 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 pkg_heap pkg_semantics pkg_lookup pkg_advantage) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)