proposition: Lemma valid_dpath_implies_valid_upath: forall g p, valid_path g p -> valid_upath g (epath_to_vpath g p).
proof: Proof. intros. unfold epath_to_vpath. destruct p. destruct l. simpl. apply H. apply valid_dpath_implies_valid_upath'. 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