proposition: Lemma Pullback_from_Equalizer_BinProduct_eq (X Y Z : C) (f : X --> Z) (g : Y --> Z) (BinProd : BinProduct C X Y) (Eq : Equalizer ((BinProductPr1 C BinProd) · f) ((BinProductPr2 C BinProd) · g)) : EqualizerArrow Eq · (BinProductPr1 C BinProd) · f = EqualizerArrow Eq · (BinProductPr2 C BinProd) · g.
proof: Proof. repeat rewrite <- assoc. apply EqualizerEqAr. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.Equalizers UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Monics