proposition: Lemma e_in_list_are_valid: forall gl e, In e (listEdges gl) -> evalid (listToGraph gl) e.
proof: Proof. intros gl e. destruct gl as [v l]. apply list_edges_evalid. 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