proposition: Lemma graph_to_tree_edge: forall lim s d t root, tree_match_graph_edges s d (snd (graph_to_tree lim root)) t.
proof: Proof. intro. apply (proj1 (graph_to_tree_edge' lim)). 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