proposition: Lemma listEdges'_app: forall l1 l2, listEdges' (l1 ++ l2) = listEdges' l1 ++ listEdges' l2.
proof: Proof. intro l1; induction l1; intros; simpl; auto. destruct a. simpl. rewrite IHl1. auto. 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