proposition: Lemma strong_evalid_adj_edge: forall g e, strong_evalid g e -> adj_edge g e (src g e) (dst g e).
proof: Proof. intros. split. auto. left; 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