proposition: Lemma lgd_no_dangling_dst: forall g e v', graph_has_v g v' -> no_dangling_dst g -> no_dangling_dst (labeledgraph_gen_dst g e v').
proof: Proof. intros. unfold no_dangling_dst in *. intros. rewrite <- lgd_graph_has_v. simpl. unfold updateEdgeFunc; if_tac; [assumption | apply (H0 v)]; 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