proposition: Lemma simple_upath_rev: forall g p, simple_upath g p -> simple_upath g (rev p).
proof: Proof. intros. split. apply valid_upath_rev; apply H. apply NoDup_rev; apply H. Qed.
imports: Coq.Logic.Classical CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_relation CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph