proposition: Lemma flcvae_dst_old: forall g new (l: list (EType * VType)) e, ~ In e (map fst l) -> dst (fold_left (copy_v_add_edge new) l g) e = dst g e.
proof: Proof. intros. revert g H. induction l; intros; simpl. 1: reflexivity. rewrite IHl. 2: intro; apply H; simpl; right; assumption. simpl. unfold updateEdgeFunc. rewrite if_false. 1: reflexivity. unfold equiv. intro. apply H. simpl. left; 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