proposition: Lemma iso2_intro (Lv : comMonoid) (Le : elabelType) (G H : graph2 Lv Le) (hv : bij G H) (he : bij (edge G) (edge H)) (hd : edge G -> bool) : is_ihom hv he hd -> hv input = input -> hv output = output -> G ≃2 H.
proof: Proof. move => hom_h. by exists (Iso hom_h). Defined.
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)