proposition: Lemma Remembers_rhs_from_tracked_lhs : ∀ ℓ v pre, Remembers_lhs ℓ v pre → Syncs ℓ pre → Remembers_rhs ℓ v pre.
proof: Proof. intros ℓ v pre hr ht. intros s₀ s₁ hpre. simpl. specialize (hr _ _ hpre). specialize (ht _ _ hpre). rewrite -ht. apply hr. 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)