proposition: Lemma is_functor_bindelta_pair_functor_data (C D E : category) (F : C ⟶ D) (G : C ⟶ E) : is_functor (bindelta_pair_functor_data _ _ _ F G).
proof: Proof. split. - intro c. simpl. rewrite functor_id. rewrite functor_id. apply idpath. - intros c c' c'' f g. simpl. rewrite functor_comp. rewrite functor_comp. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.opp_precat