proposition: Lemma collectEdges_In: forall g v l e, In e (collectEdges g v l) <-> In e l /\ src g e = v.
proof: Proof. intros. unfold collectEdges. rewrite filter_In. destruct (equiv_dec (src g e) v); hnf in * |- ; intuition. Qed.
imports: Coq.Classes.Morphisms Coq.micromega.Lia Coq.Logic.FunctionalExtensionality CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph