proposition: Lemma oiso2_le (F G : pre_graph) (i : F ⩭2 G) e : e \in eset F -> le G (efun_of i e) ≡[edir_of i e] le F e.
proof: Proof. case: i => isF isG i Ee /=. rewrite efun_bodyE edir_bodyE. exact: elabel_hom. 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)