proposition: Lemma reachable_by_path_eq_partialgraph_reachable (p: V -> Prop): forall (n1 n2: V) (l : path), g |= l is n1 ~o~> n2 satisfying p <-> (predicate_partialgraph g p) |= l is n1 ~o~> n2 satisfying (fun _ => True).
proof: Proof. intros. rewrite reachable_by_path_eq_subgraph_reachable. apply reachable_by_path_subgraph_partialgraph. Qed.
imports: Coq.Arith.Arith Coq.Logic.ProofIrrelevance Coq.Logic.FunctionalExtensionality Coq.Classes.Morphisms Coq.Classes.Equivalence CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.relation_list CertiGraph.lib.List_ext CertiGraph.lib.Equivalence_ext CertiGraph.lib.EquivDec_ext VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation