Construction 1.5.2 (Copairing). For \(f\colon C\to T\) and \(g\colon D\to T\), applying an inverse to the displayed equivalence \((i_C^*,i_D^*)\) to the pair \((f,g)\) provides a functor \[ \lra{f,g}\colon C \sqcup D \to T \] with identifications \(\lra{f,g}i_C= f\) and \(\lra{f,g}i_D= g\). For any \(h,k:C\sqcup D\to T\), restriction also induces an equivalence \[ (h= k)\iso(hi_C= ki_C)\times(hi_D= ki_D). \] To see this, use Lemma 1.3.10 for the equivalence in the coproduct axiom, then the product rule and the comparison of Construction 1.4.1. In particular, a pair of identifications \(\alpha: hi_C = ki_C\) and \(\beta: hi_D = ki_D\) results in an identification \(\lra{\alpha,\beta}:h= k\), with the prescribed restrictions to \(C\) and \(D\).