proposition: Lemma ReachDecidable_si: forall (g1 g2: PreGraph V E) (p1 p2: V -> Prop) x, g1 ~=~ g2 -> vertex_prop_coincide g1 g2 p1 p2 -> ReachDecidable g1 x p1 -> ReachDecidable g2 x p2.
proof: Proof. intros. intro y; specialize (X y). destruct X; [left | right]. + rewrite (si_reachable_by g1 g2 p1 p2) in r by auto; auto. + rewrite (si_reachable_by g1 g2 p1 p2) in n by auto; auto. 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