proposition: Lemma ram_revert_prop_pre: forall {PureF: Prop}, PureF -> forall Delta F P c Q, semax_ram Delta F (!! PureF && P) c Q -> semax_ram Delta F P c Q.
proof: Proof. intros. eapply semax_ram_pre; [| eauto]. normalize. Qed.
imports: CertiGraph.lib.Ensembles_ext CertiGraph.lib.Relation_ext CertiGraph.lib.List_ext CertiGraph.veric_ext.SeparationLogic CertiGraph.floyd_ext.ramification VST.floyd.base VST.floyd.canon VST.floyd.assert_lemmas VST.floyd.client_lemmas VST.floyd.closed_lemmas