proposition: Lemma reachable_by_weaken: forall (g: Gph) x y P Q, Included P Q -> g |= x ~o~> y satisfying P -> g |= x ~o~> y satisfying Q.
proof: Proof. intros. destruct H0 as [p [? [? ?]]]. exists p. do 2 (split; auto). apply path_prop_weaken with P; 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