proposition: Lemma listEdges'_NoDup_rev: forall l, NoDup (listEdges' l) <-> NoDup (listEdges' (rev l)).
proof: Proof. intros. pose proof (listEdges'_Permutation_rev l). rewrite H. tauto. 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