proposition: Lemma graph_local_facts: forall sh x (g: Graph), weak_valid g x -> graph sh x g |-- valid_pointer (pointer_val_val x).
proof: Proof. intros. destruct H. - simpl in H. subst x. entailer!. - eapply derives_trans. + apply (@va_reachable_root_stable_ramify pSGG_VST _ _ _ (sSGG_VST sh) g x (vgamma g x)); auto. + simpl. entailer!. Qed.
imports: CertiGraph.lib.Coqlib CertiGraph.copy.env_copy_bin CertiGraph.graph.graph_model CertiGraph.graph.weak_mark_lemmas CertiGraph.graph.local_graph_copy CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.reachable_computable CertiGraph.msl_application.Graph CertiGraph.msl_application.Graph_Copy CertiGraph.msl_application.GraphBin CertiGraph.msl_application.GraphBin_Copy CertiGraph.copy.spatial_graph_bin_copy VST.msl.wand_frame VST.floyd.reassoc_seq VST.floyd.field_at_wand