proposition: Lemma aux07: Disjoint _ PE1 PE0.
proof: Proof. intros. rewrite H_PE1, H_PE0. rewrite Disjoint_spec; intros. rewrite Intersection_spec in H, H0. unfold weak_edge_prop in H, H0. generalize (src g x), (proj1 H), (proj1 H0). 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