proposition: Lemma weak_edge_prop_Decidable: forall (P: V -> Prop) (g: PreGraph V E), (forall v, Decidable (P v)) -> (forall e, Decidable (weak_edge_prop P g e)).
proof: Proof. intros. unfold weak_edge_prop. apply X. 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