proposition: Lemma put_pre_cond_couple_lhs : ∀ ℓ v ℓ₀ ℓ₁ h, ℓ₀ != ℓ → ℓ₁ != ℓ → put_pre_cond ℓ v (couple_lhs ℓ₀ ℓ₁ h).
proof: Proof. intros ℓ v ℓ₀ ℓ₁ h n₀ n₁ s₀ s₁ hc. unfold couple_lhs in *. rewrite !get_set_heap_neq. all: 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 pkg_heap pkg_semantics pkg_lookup pkg_advantage) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)