proposition: Corollary NoDup_Perm_EList: forall (pg: PreGraph V E) {fg: FiniteGraph pg} (l: list E), Permutation l (EList pg) -> NoDup l.
proof: Proof. intros. apply (Permutation_NoDup (l:=EList pg)). apply Permutation_sym; auto. apply NoDup_EList. 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