proposition: Lemma listVertices'_In_rev: forall l v, In v (listVertices' l) <-> In v (listVertices' (rev l)).
proof: Proof. induction l; intros; simpl. 1: tauto. destruct a. simpl. rewrite listVertices'_In_app. simpl. rewrite IHl. 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