proposition: Lemma combine_prefixes_app_1: forall {A: Type} (l: list A) (a: A), cprefix (l +:: a) = cprefix l +:: (l, a).
proof: Proof. intros. unfold cprefix. rewrite prefixes_app_1. rewrite combine_app by (apply length_prefixes). auto. 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