proposition: Lemma reachable_by_path_weaken (g: Gph): forall p n1 n2 P1 P2, Included P1 P2 -> g |= p is n1 ~o~> n2 satisfying P1 -> g |= p is n1 ~o~> n2 satisfying P2.
proof: Proof. intros. destruct H0 as [? ?]. split; auto. apply good_path_weaken with P1; 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