proposition: Lemma valid_path_evalid: forall (g : Gph) v p e, valid_path g (v, p) -> In e p -> evalid g e.
proof: Proof. intros. apply (valid_path_strong_evalid g v) in H0; 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