proposition: Lemma consistentTT (G : graph) : consistent [set: G] [set: edge G].
proof: Proof. done. Qed.
imports: Coq(Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij) GraphTheory(equiv digraph setoid_bigop structures)