proposition: Lemma in_gcptr_outlier: forall g gcptr outlier n v, graph_has_v g v -> outlier_compatible g outlier -> 0 <= n < Zlength (raw_fields (vlabel g v)) -> Znth n (make_fields g v) = inl (inr gcptr) -> In gcptr outlier.
proof: Proof. intros. apply H0 in H; apply H; clear H; clear H0. unfold make_fields in H2. apply make_fields'_item_was_in_list in H2; try assumption. rewrite <- filter_sum_right_In_iff, <- filter_option_In_iff. rewrite <- H2; apply Znth_In; 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