proposition: Lemma app_eq_single_inv: forall A l (a b: A), l ++ (a::nil) = b::nil -> l = nil /\ a = b.
proof: Proof. intros. induction l. - inversion H. split; trivial. - simpl in H. inversion H. exfalso. apply (app_not_nil l a); trivial. 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