proposition: Lemma good_path_weaken: forall (g: Gph) p (P1 P2 : Ensemble V), (forall d, P1 d -> P2 d) -> good_path g P1 p -> good_path g P2 p.
proof: Proof. intros. split; destruct H0; auto. apply path_prop_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