proposition: Lemma lookup_hpv_r_eq : ∀ ℓ v l, lookup_hpv_r ℓ (hpv_r ℓ v :: l) = Some v.
proof: Proof. intros ℓ v l. funelim (lookup_hpv_r ℓ (hpv_r ℓ v :: l)). - rewrite -Heqcall. rewrite cast_loc_val_K. reflexivity. - exfalso. pose proof e as e'. symmetry in e'. move: e' => /eqP e'. contradiction. 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)