proposition: Theorem is_univalent_reindexing_forward_of_univalent (uD : is_univalent_disp D) (uC' : is_univalent C') (uC : is_univalent C) : is_univalent_disp D'.
proof: Proof. apply is_univalent_disp_from_fibers. intros c' x' y'. use weqhomot. - apply (weqcomp weq_reindexing_forward_ob_eq_Split_eq). apply (weqcomp (weq_Split_eq_Split_z_iso uC uC' uD)). exact weq_reindexing_forward_Split_z_iso_ob_z_iso. - intro e. destruct e. apply eq_z_iso_disp. cbn. apply maponpaths. apply two_arg_paths. * apply uip. apply homset_property. * reflexivity. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.NaturalTransformations UniMath.CategoryTheory.DisplayedCats.Isos UniMath.CategoryTheory.DisplayedCats.Univalence UniMath.CategoryTheory.DisplayedCats.Fibrations UniMath.CategoryTheory.DisplayedCats.StreetFibration