proposition: Lemma e_in_make_fields': forall l v n e, In (inr e) (make_fields' l v n) -> exists s, e = (v, s).
proof: Proof. induction l; intros; simpl in *. 1: exfalso; assumption. destruct a; [destruct s|]. - simpl in H. destruct H. 1: inversion H. apply IHl with (n + 1). assumption. - simpl in H. destruct H. 1: inversion H. apply IHl with (n + 1). assumption. - simpl in H. destruct H. + inversion H. exists n. reflexivity. + apply IHl with (n + 1). 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