proposition: Lemma flcvae_src_new: forall g new (l: list (EType * VType)) e, In e (map fst l) -> src (fold_left (copy_v_add_edge new) l g) e = new.
proof: Proof. intros. revert g. induction l. 1: simpl in H; exfalso; assumption. intros. simpl in *. destruct H. - subst e. destruct (in_dec equiv_dec (fst a) (map fst l)). + apply IHl; auto. + rewrite flcvae_src_old; auto. simpl. unfold updateEdgeFunc. rewrite if_true; reflexivity. - apply IHl; assumption. Qed.
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