proposition: Lemma simple_upath_app_split: forall g p p', simple_upath g (p++p') -> (simple_upath g p /\ simple_upath g p').
proof: Proof. intros. destruct H. split; split. apply (valid_upath_app_split _ _ _ H). apply (NoDup_app_l _ _ _ H0). apply (valid_upath_app_split _ _ _ H). apply (NoDup_app_r _ _ _ H0). 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