proposition: Lemma valid_upath_exists_list_edges: forall g p, valid_upath g p-> exists l, fits_upath g l p.
proof: Proof. induction p; intros. exists nil; simpl; auto. destruct p. exists nil; simpl; auto. destruct H. destruct H. apply IHp in H0. destruct H0 as [l ?]. exists (x::l). split; 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