proposition: Corollary evalid_dec: forall g {fg: FiniteGraph g} e, {evalid g e} + {~ evalid g e}.
proof: Proof. intros. destruct (in_dec EE e (EList g)). rewrite EList_evalid in i. left; auto. rewrite EList_evalid in n. right; auto. 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