proposition: Lemma pred_sepcon_ramif_item_1: forall (P P': B -> Prop) (p: B -> A) (x x': B), (exists Pf, Prop_join (eq x) Pf P /\ Prop_join (eq x') Pf P') -> pred_sepcon P p |-- p x * (p x' -* pred_sepcon P' p).
proof: Proof. intros. apply pred_sepcon_ramif_1. 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