fact: Definition INV' (L1 L2 : {fset Location}) (I : heap_choiceType * heap_choiceType → Prop) := ∀ s1 s2, (I (s1, s2) → ∀ l, l \notin L1 → l \notin L2 → get_heap s1 l = get_heap s2 l) ∧ (I (s1, s2) → ∀ l v, l \notin L1 → l \notin L2 → I (set_heap s1 l v, set_heap s2 l v)).
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)