fact: Definition uforest g := (forall e, evalid g e -> strong_evalid g e) /\ (forall p l, ~ simple_ucycle g p l).
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