proposition: Lemma NoDup_VList: forall (pg: PreGraph V E) {fg: FiniteGraph pg}, NoDup (VList pg).
proof: Proof. unfold VList; intros. destruct finiteV. unfold proj1_sig. 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