proposition: Lemma pullback_to_binprod_inv (P : some_pullback C Z) : binprod_to_pullback (pullback_to_binprod P) = P.
proof: Proof. induction P as [A [B [f [g P]]]]. unfold binprod_to_pullback , pullback_to_binprod. do 4 (apply (total2_paths2_f (idpath _)); rewrite idpath_transportf). exact (pullback_to_slice_binprod_inv P). Qed.
imports: UniMath.MoreFoundations.Tactics UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.slicecat UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.Pullbacks