proposition: Lemma precompLU_eso : disp_functor_disp_ess_split_surj precompLU.
proof: Proof. intros G GG. use tpair. - intro d. use factor_through_squash. { exact (∑ a : C, z_iso (H a) d). } { apply homset_property. } 2: exact (H_eso d). intro cd. induction (isotoid _ Duniv (pr2 cd)). refine (GG (pr1 cd) @ _). simpl. rewrite (functor_id (pr1 G)). rewrite id_right. do 3 rewrite assoc'. do 2 apply maponpaths. rewrite <- (functor_comp (pr1 G)). apply maponpaths. simpl. refine (_ @ ! TransportedLeftUnitorOnOb (pr1 cd)). apply maponpaths_2. unfold LiftPreservesPretensor. simpl. rewrite ! id_left. rewrite ! id_right. rewrite (functor_id H). rewrite id_right. etrans. 2: { apply maponpaths_2. apply (! functor_id _ _). } apply (! id_left _). - exists tt. exists tt. split ; apply isapropunit. 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.whiskering UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.PrecompEquivalence UniMath.CategoryTheory.catiso UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Monoidal.AlternativeDefinitions.MonoidalCategoriesTensored UniMath.CategoryTheory.Monoidal.AlternativeDefinitions.MonoidalFunctorCategory UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.TotalCategoryFacts UniMath.CategoryTheory.Monoidal.RezkCompletion.LiftedTensor UniMath.CategoryTheory.Monoidal.RezkCompletion.LiftedTensorUnit