proposition: Lemma reachable_by_eq: forall (g: Gph) x y P Q, (forall z, P z <-> Q z) -> (g |= x ~o~> y satisfying P <-> g |= x ~o~> y satisfying Q).
proof: Proof. intros until y. intros; split; apply reachable_by_weaken; firstorder. 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