proposition: Lemma trivial_path1: forall g e, strong_evalid g e -> connected_by_path g ((src g e)::(dst g e)::nil) (src g e) (dst g e) /\ fits_upath g (e::nil) ((src g e)::(dst g e)::nil).
proof: Proof. intros. split. split. simpl. split. exists e. split. auto. left; auto. apply H. simpl. auto. simpl. split. split. apply H. left; auto. apply H. 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