proposition: Lemma listToGraph'_preserve_evalid: forall g v e l, evalid g e -> evalid (listToGraph' g v l) e.
proof: Proof. intros. revert g v e H. induction l; intros; simpl; auto. destruct a. apply IHl. apply addEdge_preserve_evalid. 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