proposition: Lemma isaprop_cwf_fiber_representation {Γ:C} (A : Ty Γ : hSet) : is_univalent C -> isaprop (cwf_fiber_representation A).
proof: Proof. intro isC. apply invproofirrelevance. intros x x'. apply subtypePath. { intro. apply isofhleveltotal2. - apply setproperty. - intro. apply isaprop_isPullback. } destruct x as [x H]. destruct x' as [x' H']. cbn. destruct x as [ΓA m]. destruct x' as [ΓA' m']. cbn in *. destruct H as [H isP]. destruct H' as [H' isP']. use (total2_paths_f). - set (T1 := make_Pullback _ isP). set (T2 := make_Pullback _ isP'). set (i := z_iso_from_Pullback_to_Pullback T1 T2). cbn in i. set (i' := invmap (weq_ff_functor_on_z_iso (yoneda_fully_faithful _) _ _ ) i ). set (TT := isotoid _ isC i'). apply TT. - cbn. set (XT := transportf_dirprod _ (fun a' => C⟦a', Γ⟧) (fun a' => Tm a' : hSet)). cbn in XT. set (XT' := XT (tpair _ ΓA m : ∑ R : C, C ⟦ R, Γ ⟧ × (Tm R : hSet) ) (tpair _ ΓA' m' : ∑ R : C, C ⟦ R, Γ ⟧ × (Tm R : hSet) )). cbn in *. match goal with | [ |- transportf _ ?e _ = _ ] => set (TT := e) end. rewrite XT'. clear XT' XT. destruct m as [π te]. destruct m' as [π' te']. cbn. apply pathsdirprod. + unfold TT; clear TT. rewrite transportf_isotoid. cbn. unfold from_Pullback_to_Pullback. cbn in *. pose (XR' := nat_trans_eq_pointwise (PullbackArrow_PullbackPr1 (make_Pullback _ isP) (yoneda_objects C ΓA') (yoneda_morphisms C ΓA' Γ π') (yoneda_map_2 C ΓA' Tm te') (PullbackSqrCommutes (make_Pullback _ isP'))) ΓA'). cbn in XR'. assert (XR'':= toforallpaths _ _ _ XR'). cbn in XR''. etrans. { apply XR''. } apply id_left. + unfold TT; clear TT. match goal with |[|- transportf ?r _ _ = _ ] => set (P:=r) end. match goal with |[|- transportf _ (_ _ _ (_ _ ?ii)) _ = _ ] => set (i:=ii) end. simpl in i. apply (invmaponpathsweq (@yy _ Tm ΓA')). etrans. { apply transportf_yy. } etrans. { apply (@transportf_functor_isotoid C (functor_category _ SET)). } rewrite inv_from_z_iso_iso_from_fully_faithful_reflection. assert (XX:=homotweqinvweq (weq_from_fully_faithful (yoneda_fully_faithful _) ΓA' ΓA )). etrans. { apply maponpaths_2. apply XX. } clear XX. etrans. { apply maponpaths_2. unfold from_Pullback_to_Pullback. apply idpath. } pose (XR' := PullbackArrow_PullbackPr2 (make_Pullback _ isP) (yoneda_objects C ΓA') (yoneda_morphisms C ΓA' Γ π') (yoneda_map_2 C ΓA' Tm te') (PullbackSqrCommutes (make_Pullback _ isP'))). apply XR'. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Categories.HSET.All UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.yoneda UniMath.CategoryTheory.Limits.Pullbacks UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.DisplayedBicats.Examples.ContravariantFunctor UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.DisplayedBicats.Examples.Cofunctormap UniMath.Bicategories.DisplayedBicats.Examples.FullSub UniMath.Bicategories.DisplayedBicats.Examples.Sigma UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.Examples.Prod UniMath.Bicategories.DisplayedBicats.Examples.DisplayedCatToBicat