proposition: Lemma fits_upath_rev: forall g p l, fits_upath g l p -> fits_upath g (rev l) (rev p).
proof: Proof. induction p; intros. destruct l. simpl; auto. simpl in H. contradiction. destruct p. destruct l. simpl; auto. simpl in H; contradiction. destruct l. simpl in H; contradiction. destruct H. simpl. simpl in IHp. apply fits_upath_concat. apply IHp. auto. exists v. split. apply last_err_appcons. 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