proposition: Lemma sound_by_invariance': forall (P: reach_input -> Prop) (Q: list V -> Prop) i, P i -> (forall i, P i -> rch1_is_bound i) -> invariant P -> sound1 P Q -> Q (construct_reachable i).
proof: Proof. intros. apply sound_by_invariance with P; auto. intros ? ? ? ? ? ?. specialize (H0 _ H4 H3). inversion H0. Qed.
imports: Coq.Sets.Finite_sets Coq.Arith.Arith Coq.Logic.ProofIrrelevance Coq.Logic.FunctionalExtensionality Coq.Sorting.Permutation Coq.micromega.Lia CertiGraph.lib.Coqlib CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles Coq.Lists.List VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph