proposition: Lemma iso_functor_impl `(iso : A ≅ B) `(F : Functor) `(G : Functor) (T : F [≅] G) : F A ≅ G B.
proof: Proof. apply (iso_transitivity (T B) (@Functor_Congruence A B iso F _)). Qed.
imports: Ssreflect.choice Basics Endo FCompose Coq.Classes.Morphisms Coq.Setoids.Setoid Coq.Relations.Relation_Definitions