proposition: Lemma mfv_unmarked_all_is_ptr_or_int: forall (tag: Z) (g : LGraph) (v : VType), no_dangling_dst g -> graph_has_v g v -> Forall is_pointer_or_integer (map (field2val tag g) (make_fields g v)).
proof: Proof. intros. rewrite Forall_forall. intros f ?. apply list_in_map_inv in H1. destruct H1 as [x [? ?]]. destruct x as [[? | ?] | ?]; simpl in H1; subst. - if_tac; apply I. - destruct g0. exact I. - apply isptr_is_pointer_or_integer. unfold vertex_address. rewrite isptr_offset_val. apply graph_has_gen_start_isptr. apply filter_sum_right_In_iff, H in H2; [destruct 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