proposition: Lemma simple_upath_tail: forall g a p, simple_upath g (a::p) -> simple_upath g p.
proof: Proof. intros. destruct H. split. apply (valid_upath_tail' g p a). auto. apply NoDup_cons_1 in H0. auto. 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