proposition: Lemma INV'_to_INV (L L1 L2 : {fset Location}) (I : heap_choiceType * heap_choiceType → Prop) (HINV' : INV' L1 L2 I) (Hdisjoint1 : fdisjoint L L1) (Hdisjoint2 : fdisjoint L L2) : INV L I.
proof: Proof. unfold INV. intros s1 s2. split. - intros hi l hin. apply HINV'. + assumption. + move: Hdisjoint1. move /fdisjointP => Hdisjoint1. apply Hdisjoint1. assumption. + move: Hdisjoint2. move /fdisjointP => Hdisjoint2. apply Hdisjoint2. assumption. - intros hi l v hin. apply HINV'. + assumption. + move: Hdisjoint1. move /fdisjointP => Hdisjoint1. apply Hdisjoint1. assumption. + move: Hdisjoint2. move /fdisjointP => Hdisjoint2. apply Hdisjoint2. assumption. 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)