proposition: Lemma listEdges'_In_app: forall l1 l2 e, In e (listEdges' (l1 ++ l2)) <-> In e (listEdges' l1) \/ In e (listEdges' l2).
proof: Proof. intros. rewrite listEdges'_app. rewrite in_app_iff. intuition. 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