proposition: Lemma EList_evalid: forall (pg: PreGraph V E) {fg: FiniteGraph pg} e, In e (EList pg) <-> evalid pg e.
proof: Proof. intros. unfold EList. destruct finiteE. simpl. apply a. Qed.
imports: CertiGraph.lib.Coqlib CertiGraph.lib.EnumEnsembles CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.relation_list CertiGraph.lib.Equivalence_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas