proposition: Lemma efun_bodyE (G H : pre_graph) (isG : is_graph G) (isH : is_graph H) (he : bij (edge (pack G)) (edge (pack H))) e (He : e \in eset G) : efun_body he e = val (he (Sub e He)).
proof: Proof. unlock efun_body. case: {-}_ / idP => [p|]; last by rewrite He. by rewrite (bool_irrelevance He p). 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)