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