proposition: Lemma BinDirectSumIndArEq2 {a b c d : A} (f : a --> b) (g : c --> d) (B1 : BinDirectSum a c) (B2 : BinDirectSum b d) : BinDirectSumIndAr' f g B1 B2 = BinDirectSumIndArFormula f g B1 B2.
proof: Proof. unfold BinDirectSumIndAr'. rewrite <- FromBinDirectSumFormulaUnique. unfold FromBinDirectSumFormula. unfold BinDirectSumIndArFormula. rewrite assoc. rewrite assoc. apply idpath. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Notations UniMath.Algebra.BinaryOperations UniMath.Algebra.Groups UniMath.Algebra.Monoids UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.Zero UniMath.CategoryTheory.CategoriesWithBinOps UniMath.CategoryTheory.PrecategoriesWithAbgrops UniMath.CategoryTheory.PreAdditive UniMath.CategoryTheory.Monics UniMath.CategoryTheory.Epis