proposition: Lemma aux24: forall v, vvalid g root -> Union _ PV1 (eq root) v -> vvalid g v.
proof: Proof. clear - H_PV1. intros. subst PV1; rewrite Union_spec in H0; destruct H0. + apply reachable_by_through_set_foot_valid in H0; eassumption. + subst; assumption. Qed.
imports: CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.EquivDec_ext CertiGraph.lib.relation_list CertiGraph.lib.Morphisms_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.subgraph2 CertiGraph.graph.graph_morphism