proposition: Lemma sound1_and: forall (P: reach_input -> Prop) Q1 Q2, sound1 P Q1 -> sound1 P Q2 -> sound1 P (fun i => Q1 i /\ Q2 i).
proof: Proof. intros. intros ? ? ?. pose proof H _ _ H1. pose proof H0 _ _ H1. tauto. 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