fact: Definition reachable_by_acyclic (g: Gph) (n : V) (P : Ensemble V) : Ensemble V := fun n' => exists p, NoDup (epath_to_vpath g p) /\ g |= p is n ~o~> n' 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