proposition: Lemma reachable_subgraph_partialgraph (g: PreGraph V E) (p: V -> Prop): forall (n1 n2: V), reachable (predicate_subgraph g p) n1 n2 <-> reachable (predicate_partialgraph g p) n1 n2.
proof: Proof. intros. unfold reachable, reachable_by. apply ex_iff, 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