proposition: Lemma make_fields'_n_doesnt_matter: forall i l v n m gcptr, nth i (make_fields' l v n) field_t_inhabitant = inl (inr gcptr) -> nth i (make_fields' l v m) field_t_inhabitant = inl (inr gcptr).
proof: Proof. intros. unfold make_fields' in *. generalize dependent i. generalize dependent n. generalize dependent m. induction l. + intros; assumption. + induction i. - destruct a; [destruct s|]; simpl; intros; try assumption; try inversion H. - destruct a; [destruct s|]; simpl; intro; apply IHl with (m:=(m+1)%nat) in H; 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