proposition: Lemma nat_trans_comp_pointwise (C : precategory_data)(C' : precategory) (hs: has_homsets C') (F G H : ob [C, C', hs]) (A : F --> G) (A' : G --> H) (B : F --> H) : A · A' = B -> ∏ a, pr1 A a · pr1 A' a = pr1 B a.
proof: Proof. intros H' a. intermediate_path (pr1 (A · A') a). apply idpath. destruct H'. apply idpath. Qed.
imports: UniMath.Foundations.Propositions UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Univalence UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence