proposition: Lemma valid_path_cons: forall g v e p, valid_path g (v, e :: p) -> valid_path g (dst g e, p).
proof: Proof. intros. destruct H. simpl in *. destruct p. + destruct H0 as [? [? ?]]. auto. + destruct H0; auto. 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