proposition: Lemma disp_functor_transportf {C' C : category} {D' : disp_cat C'} {D : disp_cat C} (F : functor C' C) (FF : disp_functor F D' D) (x' x : C') (f' f : x' --> x) (p : f' = f) (xx' : D' x') (xx : D' x) (ff : xx' -->[ f' ] xx) : ♯ FF (transportf _ p ff) = transportf _ (maponpaths (# F) p) (♯FF ff).
proof: Proof. induction p. apply idpath. Defined.
imports: UniMath.Foundations.Sets UniMath.MoreFoundations.PartA UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Isos