proposition: Lemma list_bi_map_cons_1: forall a l x, ~ IsEither x a -> list_bi_map (a :: l) x = list_bi_map l x.
proof: Proof. intros. unfold list_bi_map. simpl. destruct a. unfold IsEither in H. simpl in H. apply Decidable.not_or in H. destruct H. destruct (equiv_dec a x). 1: exfalso; intuition. destruct (equiv_dec a0 x). 1: exfalso; intuition. 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