Reason: Let α:A↪B be a monomorphism. Let B′ be a copy of B, and likewise let A′ be a copy of A. Consider the congruence on B+B′ generated by y∼y′ for y∈A. Formally, we define E:=B+B′+A+A′ and define the two morphisms f,g:E⇉B+B′ by extending the identity on B+B′ and
f(y)g(y)=α(y),=α(y)′,f(y′)g(y′)=α(y)′,=α(y),
on generalized elements. Extensivity can be used to show that f,g are jointly monomorphic. Clearly, the pair f,g is reflexive and symmetric. For transitivity, one once again uses extensivity. By assumption, there is a morphism h:B+B′→C such that f,g is the kernel pair of h, that is, two generalized elements x,y∈B+B′ satisfy h(x)=h(y) if and only if x=f(e), y=g(e) for some e∈E. In particular, for x∈B, we have h(x)=h(x′) if and only if x=f(e), x′=g(e) for some e∈E. By disjointness of coproducts, we must necessarily have e∈A, and x=α(e). This shows that α is the equalizer of h∘i1,h∘i2:B⇉C.