Taking the reverse respects going to the strongly connected component graph
maths
Lemma
Let $G = (V,E)$ be a directed graph and $G^R= (V,E^R)$ be its reverse. Then if $S_G$ is strongly connected component graph of $G$ then the reverse of $S_G$ is equal the strongly connected component graph of $G^R$ called $S_{G^R}$. I.e. $S_G^R = S_{G^R}$.
Proof
As the strongly connected components are the same in a directed graph and its reverse we know $S_G$ and $S_{G^R}$ have the same vertex set.
The edge set for $S_G$ is
$$\{(S_i, S_j) \vert \ s_i \in S_i, s_j \in S_j\ \mbox{ with } (s_i, s_j) \in E\}.$$therefore the edge set for $S_G^R$ is
$$\{(S_j, S_i) \vert \ s_i \in S_i, s_j \in S_j\ \mbox{ with } (s_i, s_j) \in E\}.$$Which by the definition of reverse could be rephrased as
$$\{(S_j, S_i) \vert \ s_i \in S_i, s_j \in S_j\ \mbox{ with } (s_j, s_i) \in E^R\}.$$This is exactly the definition of the edge set for $S_{G^R}$ giving the required statement.