proposition: Lemma listToGraph_vvalid_dec: forall gl v, Decidable (vvalid (listToGraph gl) v).
proof: Proof. intros. destruct (in_dec equiv_dec v (listVertices gl)); [left | right]. + rewrite valid_v_eq_in_list; auto. + intro; apply n. rewrite <- valid_v_eq_in_list. auto. 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