proposition: Lemma VList_In_dec: forall g {fg: FiniteGraph g} v, In v (VList g) \/ ~ In v (VList g).
proof: Proof. intros. destruct (in_dec EV v (VList g)); [left; auto | 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