proposition: Lemma make_fields_Znth_edge: forall g v n e, 0 <= n < Zlength (raw_fields (vlabel g v)) -> Znth n (make_fields g v) = inr e -> e = (v, Z.to_nat n).
proof: Proof. intros. rewrite <- nth_Znth in H0. 2: rewrite make_fields_eq_length; assumption. apply make_fields'_edge_depends_on_index in H0. - rewrite Nat.add_0_r in H0; assumption. - rewrite Z2Nat.id; [assumption | lia]. 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