proposition: Lemma lacv_vlabel_old: forall (g : LGraph) (v : VType) (to: nat) x, x <> new_copied_v g to -> vlabel (lgraph_add_copied_v g v to) x = vlabel g x.
proof: Proof. intros. simpl. unfold update_copied_new_vlabel, graph_gen.update_vlabel. rewrite if_false. 1: reflexivity. unfold Equivalence.equiv; intro S; apply H. inversion S; 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