proposition: Lemma valid_e_are_in_list: forall g v l e, evalid (listToGraph' g v l) e -> evalid g e \/ In e (listEdges' Vertex Edge l).
proof: Proof. intros g v l. revert g v. induction l; simpl; intros; auto. destruct a. apply IHl in H. simpl in *. unfold addValidFunc 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