proposition: Lemma lacv_make_fields_vals_old: forall (g : LGraph) (v : VType) (to: nat) x, graph_has_v g x -> graph_has_gen g to -> no_dangling_dst g -> copy_compatible g -> make_fields_vals (lgraph_add_copied_v g v to) x = make_fields_vals g x.
proof: Proof. intros. pose proof (lacv_field2val_make_fields_old (raw_tag (vlabel g x)) _ v _ _ H H0 H1). unfold make_fields_vals. pose proof (graph_has_v_not_eq g to x H). rewrite lacv_vlabel_old by assumption. rewrite H3. destruct (raw_mark (vlabel g x)) eqn:? ; [f_equal | reflexivity]. apply lacv_vertex_address_old; [apply H2|]; 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