proposition: Lemma total_rightunitor_iso_law {C : category} {D : disp_cat C} {M : monoidal C} {DM : disp_monoidal_data D M} (druiso : disp_rightunitor_iso dru^{DM} druinv^{DM}) : rightunitor_iso_law (total_rightunitordata dru^{DM}) (total_rightunitorinvdata druinv^{DM}).
proof: Proof. intros x. split. - use total2_paths_b. + exact (pr1 (pr2 (monoidal_rightunitorlaw M) (pr1 x))). + exact (pr2 (druiso (pr1 x) (pr2 x))). - use total2_paths_b. * exact (pr2 (pr2 (monoidal_rightunitorlaw M) (pr1 x))). * exact (pr1 (druiso (pr1 x) (pr2 x))). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Displayed.WhiskeredDisplayedBifunctors UniMath.CategoryTheory.Monoidal.Displayed.Monoidal UniMath.CategoryTheory.Monoidal.Functors UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.CategoryTheory.DisplayedCats.Total