[guided]The useful quantity for this first step is the net amount of flow created at a vertex. Define the imbalance function $b: V \to \mathbb{R}$ by
\begin{align*}
b(w)=
\sum_{v \in V : (w,v) \in E} f(w,v)
-
\sum_{u \in V : (u,w) \in E} f(u,w)
\end{align*}
for each $w \in V$. Thus $b(w)$ is outgoing flow from $w$ minus incoming flow into $w$. Because the directed network is finite, every sum appearing here is finite, so reindexing the sums does not require any convergence theorem.
Now sum $b(w)$ over all vertices:
\begin{align*}
\sum_{w \in V} b(w)=\sum_{w \in V}\sum_{v \in V : (w,v) \in E} f(w,v)-\sum_{w \in V}\sum_{u \in V : (u,w) \in E} f(u,w).
\end{align*}
In the first double sum, an edge $(u,v) \in E$ appears exactly when the outer vertex is its tail, namely $w=u$, so it contributes $f(u,v)$ exactly once. In the second double sum, the same edge $(u,v)$ appears exactly when the outer vertex is its head, namely $w=v$, so it contributes $f(u,v)$ exactly once with the opposite sign. Reindexing both finite sums by the edge set $E$ therefore gives
\begin{align*}
\sum_{w \in V} b(w)=\sum_{(u,v) \in E} f(u,v)-\sum_{(u,v) \in E} f(u,v)=0.
\end{align*}
This proves the total-imbalance identity. In particular, even a possible edge $(s,t)$ is counted once positively at $s$ and once negatively at $t$, so it cancels in the total sum.[/guided]