fact: Definition ReachDecidable (g: Gph) (x : V) (P : V -> Prop) := forall y, Decidable (g |= x ~o~> y satisfying P).
imports: Coq.Logic.ProofIrrelevance Coq.micromega.Lia CertiGraph.lib.Coqlib CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model Coq.Lists.List Coq.Lists.ListDec