proposition: Lemma consistentT (G : graph) (E : {set edge G}) : consistent setT E.
proof: Proof. by []. Qed.
imports: Coq(Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij) GraphTheory(equiv digraph setoid_bigop structures)