Definition total_functor_commute {C₁ C₂ : category} {F : C₁ ⟶ C₂} {D₁ : disp_cat C₁} {D₂ : disp_cat C₂} (FF : disp_functor F D₁ D₂) : pr1_category D₁ ∙ F ⟹ total_functor FF ∙ pr1_category D₂. Proof. use make_nat_trans. - exact (λ _, identity _). - abstract (intros ? ? ? ; cbn ; rewrite id_left, id_right ; apply idpath). Defined.
Require Import UniMath.Foundations.Sets. Require Import UniMath.MoreFoundations.AxiomOfChoice. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.Core.Functors. Require Import UniMath.CategoryTheory.Core.NaturalTransformations. Require Import UniMath.CategoryTheory.Core.Isos. Require Import UniMath.CategoryTheory.Core.Univalence. Require Import UniMath.CategoryTheory.DisplayedCats.Core. Require Import UniMath.CategoryTheory.DisplayedCats.Functors. Require Import UniMath.CategoryTheory.DisplayedCats.NaturalTransformations. Require Import UniMath.CategoryTheory.DisplayedCats.Isos. Require Import UniMath.CategoryTheory.DisplayedCats.Univalence.