proposition: Lemma list_map_not_In: forall l x, ~ In x (map fst l) -> list_map l x = x.
proof: Proof. induction l; intros. 1: unfold list_map; simpl; reflexivity. simpl in H. apply Decidable.not_or in H. destruct H. rewrite list_map_cons_1. 2: intuition. now apply IHl. 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