proposition: Lemma graph_to_tree_contains_reachable: forall lim root (H: Enumerable Vertex (reachable G root)) x, 2 * sizeOfEnum H - 1 <= lim -> vvalid G root -> is_tree G root -> reachable G root x -> In x (leaves (snd (graph_to_tree lim root))).
proof: Proof. intros. apply ((proj1 (graph_to_tree_contains_reachable' lim _ H1 H2 _ H3)) H H0). Qed.
imports: Coq.Arith.Arith CertiGraph.lib.Coqlib CertiGraph.lib.EnumEnsembles CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.graph.reachable_computable Coq.Lists.List