proposition: 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: Proof. apply inner_swap_hexagon. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Structure.Symmetric