proposition: Lemma epath_to_vpath_eq: forall (g : Gph) src l, valid_path g (src, l) -> epath_to_vpath g (src, l) = src :: map (dst g) l.
proof: Proof. intros g src l. revert src. induction l. reflexivity. intros. simpl map. rewrite <- IHl. rewrite epath_to_vpath_cons_eq. trivial. simpl in H. tauto. apply valid_path_tail in H. apply H. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.micromega.Lia CertiGraph.lib.Coqlib CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model Coq.Lists.List Coq.Lists.ListDec