proposition: Lemma aux14: forall e, PE0 e -> PV1 (src g e) -> False.
proof: Proof. intros. subst PE0. rewrite Intersection_spec in H. destruct H. unfold weak_edge_prop in H. generalize (src g e) H0 H. rewrite <- Disjoint_spec. apply aux06. 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