Our course material gives us the following equation without proving it :
Let's consider a continuous-time Markov chain. Its discrete state-space is $\epsilon$ and its infinitesimal generator is $\mathbf{Q}$. $S$ and $S'$ are two subsets of $\epsilon$ such that $S \cup S' = \epsilon$ and $S \cap S' = \emptyset$ : $$ \sum_{i \in S}\sum_{j \in S'} \pi_iq_{i,j} = \sum_{i \in S'}\sum_{j \in S} \pi_iq_{i,j} $$
I tried to prove it myself using the principle of flow conservation $\sum_{i \in \epsilon} \pi_iq_{i,j} = 0$ but i always end up looping. It seems like it works using the time-reversibility property ($\pi_iq_{i,j} = \pi_jq_{j,i}$) but i'm almost certain it's not usable in a generic case.
Thanks for your answers !