proposition: Lemma aux16: forall e, PE1_root e -> PV0 (dst g e) -> False.
proof: Proof. intros. subst PV0. pose proof reachable_by_foot_valid _ _ _ _ H0. apply reachable_by_foot_prop in H0. rewrite H_Mrec in *. apply H0; unfold Ensembles.In; clear H0. rewrite Union_spec. destruct (M0_DEC (dst g e)); [left; auto | right]. subst PV1 PE1_root; exists (dst g e). split; [apply in_map; auto |]. apply reachable_by_refl; auto. 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