proposition: Lemma iter_sepcon_ramif_1: forall P P' (g g': list B) (x x': B), (exists f, Permutation g (x :: f) /\ Permutation g' (x' :: f) /\ (forall x, In x f -> P x = P' x)) -> iter_sepcon g P |-- P x * (P' x' -* iter_sepcon g' P').
proof: Proof. intros. pose proof iter_sepcon_ramif_1Q (fun x: unit => True) P (fun _ => P') g (fun _ => g') x (fun _ => x'). rewrite allp_unit in H0. rewrite prop_imp in H0 by auto. apply H0. destruct H as [f [? [? ?]]]; exists f. split; [| split]; intros; auto. Qed.
imports: CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext VST.msl.base VST.msl.simple_CCC VST.msl.seplog VST.msl.log_normalize VST.msl.Coqlib2 VST.msl.ramification_lemmas