proposition: Lemma remove_edges_add_test (G : pre_graph) E x a : (remove_edges G E)[adt x <- a] ≡G remove_edges G[adt x <- a] E.
proof: Proof. done. 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)