Proposition psfunctor_fib_to_psfunctor_counit_natural_laws {F G : psfunctor (cat_to_bicat C^op) bicat_of_univ_cats} (τ : pstrans F G) : is_modification (psfunctor_fib_to_psfunctor_counit_natural_data τ). Proof. intros x y f. use nat_trans_eq. { apply homset_property. } intros xx. cbn -[psfunctor_id psfunctor_comp]. unfold psfunctor_fib_to_psfunctor_counit_natural_nat_trans_data. unfold psfunctor_fib_to_psfunctor_counit_data_ob_nat_trans_data. cbn in x, y, f, xx. etrans. { do 2 refine (id_right _ @ _). apply maponpaths_2. refine (id_right _ @ _). apply id_left. } etrans. { apply maponpaths. refine (functor_id (pr111 τ y) _). } refine (id_right _ @ _). refine (!_). etrans. { etrans. { apply maponpaths_2. apply functor_id. } refine (id_left _ @ _). refine (id_right _ @ _). etrans. { apply maponpaths_2. refine (id_right _ @ _). apply id_left. } apply id_left. } unfold is_cartesian_indexed_cat_factorisation. unfold is_cartesian_to_iso_indexed_cat_inv. cbn -[psfunctor_id psfunctor_comp]. unfold is_cartesian_indexed_cat_factorisation. cbn -[psfunctor_id psfunctor_comp]. etrans. { apply maponpaths_2. do 2 apply maponpaths. etrans. { do 2 apply maponpaths. apply maponpaths_2. etrans. { apply maponpaths. apply functor_id. } apply id_right. } etrans. { do 2 apply maponpaths. apply maponpaths_2. rewrite assoc'. etrans. { apply maponpaths. exact (nat_trans_eq_pointwise (vcomp_rinv (psfunctor_comp F f (identity y))) xx). } apply id_right. } etrans. { apply maponpaths. etrans. { apply maponpaths. exact (nat_trans_eq_pointwise (vcomp_rinv (psfunctor_id F y)) _). } apply functor_id. } apply id_right. } etrans. { rewrite !assoc'. do 2 apply maponpaths. apply (nat_trans_ax ((psfunctor_id G y) ^-1)). } refine (_ @ id_left _). do 2 refine (assoc _ _ _ @ _). apply maponpaths_2. etrans. { do 2 apply maponpaths_2. refine (transportf_psfunctor_into_cat _ _ _ _ @ _). apply id_left. } pose (nat_trans_eq_pointwise (psfunctor_F_runitor G f) (pr1 ((pr111 τ) x) xx)) as p. cbn -[psfunctor_id psfunctor_comp] in p. refine (assoc' _ _ _ @ _). etrans. { apply maponpaths. refine (_ @ !p). apply (!(id_right _)). } refine (!(nat_trans_eq_pointwise (psfunctor_vcomp G _ _) _) @ _). refine (_ @ nat_trans_eq_pointwise (psfunctor_id2 G _) _). refine (maponpaths (λ z, pr1 (##G z) _) _). apply homset_property. Qed.
Require Import UniMath.MoreFoundations.All. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.Core.Isos. Require Import UniMath.CategoryTheory.Core.Univalence. Require Import UniMath.CategoryTheory.Core.Functors. Require Import UniMath.CategoryTheory.Core.NaturalTransformations. Require Import UniMath.CategoryTheory.opp_precat. Require Import UniMath.CategoryTheory.OppositeCategory.Core. Require Import UniMath.CategoryTheory.Adjunctions.Core. Require Import UniMath.CategoryTheory.Equivalences.Core. Require Import UniMath.CategoryTheory.DisplayedCats.Core. Require Import UniMath.CategoryTheory.DisplayedCats.Isos. Require Import UniMath.CategoryTheory.DisplayedCats.Fibrations. Require Import UniMath.CategoryTheory.DisplayedCats.Functors. Require Import UniMath.CategoryTheory.DisplayedCats.Fiber. Require Import UniMath.CategoryTheory.DisplayedCats.NaturalTransformations. Require Import UniMath.CategoryTheory.DisplayedCats.Univalence. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedCategory. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedFunctor. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedTransformation. Require Import UniMath.CategoryTheory.IndexedCategories.FibrationToIndexedCategory. Require Import UniMath.CategoryTheory.IndexedCategories.CartesianToIndexedFunctor. Require Import UniMath.CategoryTheory.IndexedCategories.NatTransToIndexed. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedCategoryToFibration. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedFunctorToCartesian. Require Import UniMath.CategoryTheory.IndexedCategories.IndexedTransformationToTransformation. Require Import UniMath.Bicategories.Core.Bicat. Import Bicat.Notations. Require Import UniMath.Bicategories.Core.Discreteness. Require Import UniMath.Bicategories.Core.Invertible_2cells. Require Import UniMath.Bicategories.Core.Univalence. Require Import UniMath.Bicategories.Core.EquivToAdjequiv. Require Import UniMath.Bicategories.Core.Examples.BicatOfUnivCats. Require Import UniMath.Bicategories.Core.Examples.DiscreteBicat. Require Import UniMath.Bicategories.Core.Examples.FibSlice. Require Import UniMath.Bicategories.Morphisms.Adjunctions. Require Import UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat. Require Import UniMath.Bicategories.PseudoFunctors.PseudoFunctor. Import PseudoFunctor.Notations. Require Import UniMath.Bicategories.PseudoFunctors.Examples.Identity. Require Import UniMath.Bicategories.PseudoFunctors.Examples.Composition. Require Import UniMath.Bicategories.PseudoFunctors.Examples.PseudoFunctorsIntoCat. Require Import UniMath.Bicategories.Transformations.PseudoTransformation. Require Import UniMath.Bicategories.Transformations.Examples.PseudoTransformationIntoCat. Require Import UniMath.Bicategories.Modifications.Modification. Require Import UniMath.Bicategories.Modifications.Examples.ModificationIntoCat. Require Import UniMath.Bicategories.Grothendieck.FibrationToPseudoFunctor. Require Import UniMath.Bicategories.Grothendieck.PseudoFunctorToFibration.