proposition: Lemma listToGraph'_In_dst: forall g v l e, In e (listEdges (v, l)) -> In (dst (listToGraph' g v l) e) (listVertices (v, l)).
proof: Proof. intros. apply (listToGraph'_In g) in H. 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