proposition: Proposition make_profunctor_nat_trans_law : is_nat_trans _ _ make_profunctor_nat_trans_data.
proof: Proof. intros xy₁ xy₂ fg. induction xy₁ as [ y₁ x₁ ]. induction xy₂ as [ y₂ x₂ ]. induction fg as [ g f ]. use funextsec. intro h. pose (H _ _ _ _ g f h) as p. cbn in *. refine (_ @ p @ _) ; clear p. - rewrite lmap_rmap_functor. apply idpath. - rewrite lmap_rmap_functor. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Categories.HSET.All UniMath.CategoryTheory.Categories.HSET.SetCoends UniMath.CategoryTheory.Profunctors.Core UniMath.CategoryTheory.Profunctors.Examples