proposition: Lemma map_snd_cprefix: forall {A: Type} (l: list A), map snd (cprefix l) = l.
proof: Proof. intros. apply map_snd_combine. apply length_prefixes. 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