proposition: Lemma contract_get : ∀ A ℓ (r : _ → _ → raw_code A), ⊢ ⦃ λ '(h₀, h₁), h₀ = h₁ ⦄ z ← get ℓ ;; r z z ≈ x ← get ℓ ;; y ← get ℓ ;; r x y ⦃ eq ⦄.
proof: Proof. intros A ℓ r. eapply rrewrite_eqDistrR. 1: eapply rreflexivity_rule. intros s. simpl. 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 pkg_invariants pkg_distr) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)