proposition: Lemma Graph_reachable_dec: forall (G: UFGraph) x, Decidable (vvalid G x) -> forall y, Decidable (reachable G x y).
proof: Proof. intros. apply reachable_decidable with (is_null := isNullDec); auto. + apply maGraph. + apply LocalFiniteGraph_FiniteGraph, finGraph. + apply FiniteGraph_EnumCovered, finGraph. Qed.
imports: Coq.Sets.Ensembles Coq.Lists.List CertiGraph.lib.EquivDec_ext CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph CertiGraph.graph.MathGraph CertiGraph.graph.LstGraph CertiGraph.graph.UnionFind