proposition: Lemma root_update_ramify: forall (g: Graph) (x: V) (lx: bool) (gx gx': GV), vvalid g x -> vgamma (Graph_PointwiseGraph g) x = gx -> vgamma (Graph_PointwiseGraph (labeledgraph_vgen g x lx)) x = gx' -> Included (Intersection V (reachable g x) (Complement V (eq x))) (vguard g) -> Included (Intersection V (reachable g x) (Complement V (eq x))) (vguard (labeledgraph_vgen g x lx)) -> @derives Pred _ (reachable_vertices_at x g) (vertex_at x gx * (vertex_at x gx' -* reachable_vertices_at x (labeledgraph_vgen g x lx))).
proof: Proof. apply va_reachable_root_update_ramify. Qed.
imports: VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.relation_list CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.ramification_lemmas 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 Coq.Logic.Classical