proposition: Lemma list_map_In: forall l k v, NoDup (map fst l) -> In (k, v) l -> list_map l k = v.
proof: Proof. intros. unfold list_map. now rewrite (NoDup_look_up k v). Qed.
imports: Coq.Lists.List Coq.micromega.Lia Coq.Sorting.Permutation Coq.ZArith.ZArith_base Coq.ZArith.Zcomplements Coq.Logic.FunctionalExtensionality CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext VST.zlist.sublist VST.zlist.list_solver