proposition: Lemma listVertices'_In_app: forall l1 l2 v, In v (listVertices' (l1 ++ l2)) <-> In v (listVertices' l1) \/ In v (listVertices' l2).
proof: Proof. intros l1; induction l1; intros; simpl. 1: tauto. destruct a. simpl. rewrite IHl1. tauto. Qed.
imports: Coq.Classes.Morphisms Coq.micromega.Lia Coq.Logic.FunctionalExtensionality CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph