proposition: Lemma reachable_by_is_reachable (g: Gph): forall n1 n2 P, g |= n1 ~o~> n2 satisfying P -> reachable g n1 n2.
proof: Proof. intros. unfold reachable. destruct H as [l [? [? ?]]]. exists l. do 2 (split; auto). red. split; auto. rewrite Forall_forall; intros; auto. Qed.
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