proposition: Lemma reachable_by_through_set_weaken: forall (g: Gph) l x P Q, Included P Q -> reachable_by_through_set g l P x -> reachable_by_through_set g l Q x.
proof: Proof. intros. destruct H0 as [s [? ?]]. exists s; split; auto. eapply reachable_by_weaken; eauto. 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