fact: Definition copied_vertex_prop (g: LGraph) (from to: nat): Prop := forall v, let cv := copied_vertex (vlabel g v) in graph_has_v g v -> raw_mark (vlabel g v) = true -> graph_has_v g cv /\ vgeneration cv = to /\ vgeneration v = from /\ map snd (get_edges g v) = map snd (get_edges g cv) /\ forall idx, In idx (map snd (get_edges g v)) -> dst g (cv, idx) = dst g (v, idx) \/ raw_mark (vlabel g (dst g (v, idx))) = true /\ dst g (cv, idx) = copied_vertex (vlabel g (dst g (v, idx))).
imports: Coq.ZArith.ZArith Coq.Program.Basics compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph