proposition: Lemma list_map_cons_1: forall a l x, x <> fst a -> list_map (a :: l) x = list_map l x.
proof: Proof. intros. unfold list_map. simpl. destruct a. simpl in *. destruct (equiv_dec a x). 1: unfold equiv in e; exfalso; apply H; subst; easy. reflexivity. 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