proposition: Lemma pred_sepcon_ramif_1: forall (P P': B -> Prop) (p p': B -> A) (x x': B), (exists Pf, Prop_join (eq x) Pf P /\ Prop_join (eq x') Pf P' /\ (forall y, Pf y -> p y = p' y)) -> pred_sepcon P p |-- p x * (p' x' -* pred_sepcon P' p').
proof: Proof. intros. pose proof pred_sepcon_ramif_1Q (fun _: unit => True) P (fun _ => P') p (fun _ => p') 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]; 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