proposition: Lemma ecopy1_vmap_root: forall (g1 g2 g1' g2': Graph) e x0, ecopy1 e (g1, g1') (g2, g2') -> LocalGraphCopy.vmap g1 x0 = LocalGraphCopy.vmap g2 x0.
proof: Proof. intros. destruct H as [_ [_ ?]]. apply (LocalGraphCopy.ecopy1_vmap_root g1 g2 g1' g2' e x0); auto. 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.lib.Morphisms_ext 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.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.subgraph2 CertiGraph.graph.dag CertiGraph.graph.weak_mark_lemmas CertiGraph.graph.graph_morphism CertiGraph.graph.local_graph_copy CertiGraph.msl_application.Graph Coq.Logic.Classical