proposition: Lemma fits_upath_cons: forall g p l e v v0, fits_upath g (e::l) (v::v0::p) -> fits_upath g l (v0::p).
proof: Proof. intros; destruct p; destruct l. simpl. apply H. simpl in H. destruct H. auto. simpl in H. destruct H. contradiction. simpl in H. destruct H. destruct H0. simpl. 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