Proof: Let C,D be categories with biproducts, and let F:C→D be a functor preserving finite coproducts. In particular, F preserves the zero object. Since zero morphisms are precisely the morphisms that factor through the zero object, F preserves zero morphisms.
Let A,B∈C be objects with coproduct injections iA:A→A⊔B and iB:B→A⊔B. Since C has biproducts, there are projections pA:A⊔B→A and pB:A⊔B→B satisfying: pAiApBiApAiBpBiBiApA+iBpB=idA=0=0=idB=idA⊔B. By assumption, F(A⊔B) is a coproduct of F(A) and F(B) with coproduct injections F(iA) and F(iB). Since D has biproducts, there are product projections qA:F(A⊔B)→F(A) and qB:F(A⊔B)→F(B) satisfying: qAF(iA)qBF(iA)qAF(iB)qBF(iB)F(iA)qA+F(iB)qB=idF(A)=0=0=idF(B)=idF(A⊔B). We need to show that F(pA)=qA; the proof that F(pB)=qB is similar. Both sides are morphisms F(A⊔B)→F(A), and since F(A⊔B) is a coproduct of F(A) and F(B), it suffices to verify the equality after precomposing with the two coproduct injections F(iA) and F(iB). We compute qAF(iA)=idF(A)=F(idA)=F(pAiA)=F(pA)F(iA) and qAF(iB)=0=F(0)=F(pAiB)=F(pA)F(iB). Remark: It now follows that F is also additive, i.e., for two morphisms f,g:A⇉B, we have F(f+g)=F(f)+F(g). In fact, f+g decomposes as A(f,g)B×Bμ−1B⊔B∇B, and each of these components is preserved by F.