proposition: Lemma right_weak_valid: forall (G G1 G2: Graph) (x l r: addr), vgamma G x = (false, l, r) -> vvalid G x -> mark1 x G G1 -> mark l G1 G2 -> @weak_valid _ _ _ _ G2 _ (maGraph _) r.
proof: Proof. intros. destruct H1 as [? _]. destruct H2 as [_ ?]. eapply weak_valid_si; [symmetry; transitivity G1; [exact H1 | exact H2] |]. eapply gamma_right_weak_valid; eauto. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize VST.msl.Coqlib2 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.relation_list CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.dag CertiGraph.graph.weak_mark_lemmas CertiGraph.msl_application.Graph CertiGraph.msl_application.Graph_Mark CertiGraph.msl_application.GraphBin Coq.Logic.Classical