proposition: Lemma reachable_by_trans: forall (g: Gph) n1 n2 n3 P, g |= n1 ~o~> n2 satisfying P -> g |= n2 ~o~> n3 satisfying P -> g |= n1 ~o~> n3 satisfying P.
proof: Proof. do 2 destruct 1. exists (x +++ x0). apply reachable_by_path_merge with n2; 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