proposition: Lemma go_lower_ModBox: forall c P rho, ModBox c P rho = ALL rho' : environ , !!vars_relation (modifiedvars c) rho rho' --> P rho'.
proof: Proof. intros. reflexivity. Qed.
imports: CertiGraph.lib.Equivalence_ext CertiGraph.veric_ext.SeparationLogic VST.floyd.base VST.floyd.client_lemmas VST.floyd.assert_lemmas VST.floyd.closed_lemmas VST.floyd.forward_lemmas