proposition: Lemma lgd_no_dangling_dst_copied_vert: forall g e v, copy_compatible g -> graph_has_v g v -> raw_mark (vlabel g v) = true -> no_dangling_dst g -> no_dangling_dst (labeledgraph_gen_dst g e (copied_vertex (vlabel g v))).
proof: Proof. intros. assert (graph_has_v g (copied_vertex (vlabel g v))) by apply (H v H0 H1). apply lgd_no_dangling_dst; assumption. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia 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 VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen