proposition: Lemma heap_val_eqP : Equality.axiom heap_val_eq.
proof: Proof. intros u v. destruct u, v. all: simpl. 2,3: constructor. 2,3: discriminate. all: unfold loc_val_pair. all: destruct eq_op eqn:e. all: move: e => /eqP e. all: noconf e. all: constructor. all: try reflexivity. all: intro h. all: inversion h. all: 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)