proposition: Lemma ang_make_fields_vals_old: forall g gi v, graph_has_v g v -> copy_compatible g -> no_dangling_dst g -> make_fields_vals g v = make_fields_vals (lgraph_add_new_gen g gi) v.
proof: Proof. intros. unfold make_fields_vals. simpl. assert (map (field2val (raw_tag (vlabel g v)) g) (make_fields g v) = map (field2val (raw_tag (vlabel g v)) (lgraph_add_new_gen g gi)) (make_fields (lgraph_add_new_gen g gi) v)). { unfold make_fields. simpl. apply map_ext_in. intros. destruct a; [destruct s|]; simpl; auto. rewrite ang_vertex_address_old; auto. red in H1. apply (H1 v); auto. unfold get_edges. rewrite <- filter_sum_right_In_iff. assumption. } rewrite <- H2. destruct (raw_mark (vlabel g v)) eqn:?; auto. f_equal. rewrite ang_vertex_address_old; auto. destruct (H0 _ H Heqb). 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