proposition: Lemma remove_edgesD (G : pre_graph) E : [disjoint eset G & E] -> G - E ≡G G.
proof: Proof. move => D. split => //=. exact: fsetDidPl. Qed.
imports: Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom mgraph mgraph2) GraphTheory(rewriting open_confluence finmap_plus)