proposition: Lemma pred_sepcon_ramif_item_xQ: forall {T: Type} (Pure: T -> Prop) (G L: B -> Prop) (L' G': T -> B -> Prop) (p: B -> A), (exists Pf, Prop_join L Pf G /\ (forall a, Pure a -> Prop_join (L' a) Pf (G' a))) -> pred_sepcon G p |-- pred_sepcon L p * (ALL a: T, !! Pure a --> (pred_sepcon (L' a) p -* pred_sepcon (G' a) p)).
proof: Proof. intros. apply pred_sepcon_ramif_xQ. 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