proposition: Lemma efun_of_inj (F G : pre_graph) (i : F ⩭2 G) : {in eset F&, injective (efun_of i)}.
proof: Proof. move => e1 e2 eF1 eF2. rewrite /= !efun_bodyE. move/val_inj. by move/(bij_injective (f := (oiso2_iso i).e)) => []. 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)