Lemma inner_swap_hexagon_2 (x y : V) : inner_swap (x ⊗ x) x (y ⊗ y) y · (inner_swap x x y y ⊗^{V}_{r} (x ⊗ y) · mon_lassociator _ _ _) = mon_lassociator _ _ _ #⊗ mon_lassociator _ _ _ · (inner_swap x (x ⊗ x) y (y ⊗ y) · (x ⊗ y) ⊗^{V}_{l} inner_swap x x y y). Proof. apply inner_swap_hexagon. Qed.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.Core.Functors. Require Import UniMath.CategoryTheory.Core.Isos. Require Import UniMath.CategoryTheory.Limits.BinProducts. Require Import UniMath.CategoryTheory.PrecategoryBinProduct. Require Import UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors. Require Import UniMath.CategoryTheory.Monoidal.Categories. Import BifunctorNotations. Require Import UniMath.CategoryTheory.Monoidal.Structure.Symmetric. Import MonoidalNotations.