I was trying to prove directly that, for $a,b$ positive integers:
$$\sum_{n=1}^{a+b} \frac{(-1)^n}{n}\binom{n}{n-a,n-b,a+b-n}=0$$
Alternatively:
$$\sum_{n=1}^{a+b}\frac{(-1)^n}{n}\binom{n}{a}\binom{a}{n-b}=0$$
This comes from trying to prove the formal power series identity:
If $f(x)=\sum_{n=1}^{\infty}\frac{x^n}{n}$ then $$f(x)+f(y)=f(x+y-xy)$$
which we know is true because $f(x)=-\log(1-x)$ in the complex numbers when $|x|<1$.
I would like to prove this directly, without referencing logarithm, and it reduces to the above identity.
(Note: $\binom{n}{i,j,k}=\binom{n}{i}\binom{n-i}{j}=\frac{n!}{i!j!k!}$ is the trinomial coefficient, defined when $i+j+k=n$)
It is convenient to use the coefficient of operator $[z^k]$ to denote the coefficient of $z^k$ in a series. This way we can write e.g. \begin{align*} [z^k](1+z)^n=\binom{n}{k} \end{align*}
In (1) we use the binomial identity \begin{align*} \binom{n}{a}=\frac{n}{a}\binom{n-1}{a-1} \end{align*}
In (2) we shift the index $n$ by $1$.
In (3) we apply the coefficient of operator twice. We also extend the limits of the series without changing anything since we are adding zeros only.
In (4) we use the linearity of the coefficient of operator.
In (5) we use the substitution rule of the coefficient of operator with $u:= -(1+z)$ \begin{align*} A(z)=\sum_{n=0}^\infty a_n z^n=\sum_{n=0}^\infty z^n [u^n]A(u) \end{align*}
In (6) we observe the coefficient of $z^{a-1}$ is zero.