fact: Definition pack' : graph := {| vertex := vset G; edge := eset G; endpoint b e := Sub (endpt G b (val e)) (endpt_proof b e); vlabel v := lv G (val v); elabel e := le G (val e) |}.
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)