fact: Definition admissible_l (G: graph2) (H: eqType) (e : pairs (G+H)) := all (fun x => if x is inl z then z \in IO else true) (mentions e).
imports: HB(structures) Coq(Setoid Morphisms) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom mgraph mgraph2 rewriting)