proposition: Lemma pcv_dst_old: forall g old new e, fst e <> new -> dst (pregraph_copy_v g old new) e = dst g e.
proof: Proof. intros. unfold pregraph_copy_v. rewrite flcvae_dst_old. 1: simpl; reflexivity. intro. apply H. rewrite map_fst_combine in H0. - destruct e. simpl in *. apply in_combine_l, repeat_spec in H0. assumption. - unfold EType. rewrite combine_length, repeat_length, !map_length, Nat.min_id. reflexivity. 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