proposition: Lemma setT_bij_hom (G : graph) : @is_ihom (subgraph_for (consistentTT G)) G setT_bij setT_bij xpred0.
proof: Proof. by []. Qed.
imports: Coq(Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij) GraphTheory(equiv digraph setoid_bigop structures)