proposition: Lemma va_reachable_internal_stable_ramify: forall (g: Graph) (x y: V) (gy: GV), vvalid g y -> vgamma (Graph_PointwiseGraph g) y = gy -> reachable g x y -> @derives _ _ (reachable_vertices_at x g) (vertex_at y gy * (vertex_at y gy -* reachable_vertices_at x g)).
proof: Proof. intros. subst. apply vertices_at_ramif_1_stable; auto. Qed.
imports: Coq.Logic.Classical VST.msl.seplog VST.msl.log_normalize VST.msl.ramification_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.lib.Relation_ext CertiGraph.lib.Equivalence_ext CertiGraph.lib.Morphisms_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.ramification_lemmas CertiGraph.msl_ext.abs_addr CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.dag CertiGraph.graph.FiniteGraph