proposition: Lemma remove_edges0 (G : pre_graph) : G - fset0 ≡G G.
proof: Proof. split => //=. exact: fsetD0. Qed.
imports: HB(structures) Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom rewriting) GraphTheory(finmap_plus)