proposition: Lemma si_stronger_partialgraph_simple: forall (g1 g2: PreGraph V E) (p p': V -> Prop), Included p' p -> (predicate_partialgraph g1 p) ~=~ (predicate_partialgraph g2 p) -> (predicate_partialgraph g1 p') ~=~ (predicate_partialgraph g2 p').
proof: Proof. intros. eapply si_stronger_partialgraph with (p := p'); [| | exact H0]. + intro v; specialize (H v); simpl in H; tauto. + intro v; specialize (H v); simpl in H; tauto. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.Sets.Ensembles Coq.Sets.Finite_sets Coq.Classes.Morphisms 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 Coq.Lists.List CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind