proposition: Lemma is_functor_fiber_functor : is_functor fiber_functor_data.
proof: Proof. split; unfold functor_idax, functor_compax; cbn. - intros. apply transportf_pathsinv0. apply pathsinv0. apply disp_functor_id. - intros. etrans. apply maponpaths. apply disp_functor_transportf. etrans. apply transport_f_f. etrans. apply maponpaths. apply disp_functor_comp. etrans. apply transport_f_f. apply pathsinv0. etrans. apply maponpaths. apply mor_disp_transportf_prewhisker. etrans. apply transport_f_f. etrans. apply maponpaths. apply mor_disp_transportf_postwhisker. etrans. apply transport_f_f. apply maponpaths_2, homset_property. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.NaturalTransformations UniMath.CategoryTheory.DisplayedCats.Isos UniMath.CategoryTheory.DisplayedCats.Univalence UniMath.CategoryTheory.DisplayedCats.Total