proposition: Lemma in_cprefix: forall {A: Type} (xs: list A) xs0 x0, In (xs0, x0) (cprefix xs) -> In x0 xs.
proof: Proof. intros. rev_induction xs. + inversion H. + rewrite combine_prefixes_app_1 in H0. rewrite in_app_iff in H0 |- *. destruct H0. - auto. - destruct H0 as [| []]. inversion H0; subst. simpl; 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