proposition: Proposition enriched_rezk_completion_ump_comm_laws : is_nat_trans G (F ∙ enriched_rezk_completion_ump_functor) (λ x, enriched_rezk_completion_ump_functor_iso (F x) (identity_z_iso (F x))).
proof: Proof. intros x y f ; cbn. refine (!_). refine (enriched_rezk_completion_ump_functor_mor_eq _ f _ (identity_z_iso _) _). cbn. rewrite id_right, id_left. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.EnrichedCats.Enrichment UniMath.CategoryTheory.EnrichedCats.EnrichmentFunctor UniMath.CategoryTheory.EnrichedCats.EnrichmentTransformation UniMath.CategoryTheory.EnrichedCats.FullyFaithful UniMath.CategoryTheory.EnrichedCats.Examples.FunctorCategory UniMath.CategoryTheory.EnrichedCats.Examples.Precomposition UniMath.CategoryTheory.Monoidal.Categories