We shall employ mathematical induction on the length of the composition series. If the length of a composition series is 1, then \(G\) must be a simple group. In this case any two composition series are isomorphic.
Suppose now that the theorem is true for all groups having a composition series of length \(k\text{,}\) where \(1 \leq k \lt n\text{.}\) Let
\begin{gather*}
G = H_n \supset H_{n-1} \supset \cdots \supset H_1 \supset H_0 = \{ e \}\\
G = K_m \supset K_{m-1} \supset \cdots \supset K_1 \supset K_0 = \{ e \}
\end{gather*}
be two composition series for \(G\text{.}\) We can form two new subnormal series for \(G\) since \(H_i \cap K_{m-1}\) is normal in \(H_{i+1} \cap K_{m-1}\) and \(K_j \cap H_{n-1}\) is normal in \(K_{j+1} \cap H_{n-1}\text{:}\)
\begin{gather*}
G = H_n \supset H_{n-1} \supset H_{n-1} \cap K_{m-1} \supset \cdots \supset H_0 \cap K_{m-1} = \{ e \}\\
G = K_m \supset K_{m-1} \supset K_{m-1} \cap H_{n-1} \supset \cdots \supset K_0 \cap H_{n-1} = \{ e \}\text{.}
\end{gather*}
Since
\(H_i \cap K_{m-1}\) is normal in
\(H_{i+1} \cap K_{m-1}\text{,}\) the Second Isomorphism Theorem (
Theorem 11.12) implies that
\begin{align*}
(H_{i+1} \cap K_{m-1}) / (H_i \cap K_{m-1}) & = (H_{i+1} \cap K_{m-1}) / (H_i \cap ( H_{i+1} \cap K_{m-1} ))\\
& \cong H_i (H_{i+1} \cap K_{m-1})/ H_i\text{,}
\end{align*}
where \(H_i\) is normal in \(H_i (H_{i+1} \cap K_{m-1})\text{.}\) Since \(\{ H_i \}\) is a composition series, \(H_{i+1} / H_i\) must be simple; consequently, \(H_i (H_{i+1} \cap K_{m-1})/ H_i\) is either \(H_{i+1}/H_i\) or \(H_i/H_i\text{.}\) That is, \(H_i (H_{i+1} \cap K_{m-1})\) must be either \(H_i\) or \(H_{i+1}\text{.}\) Removing any nonproper inclusions from the series
\begin{equation*}
H_{n-1} \supset H_{n-1} \cap K_{m-1} \supset \cdots \supset H_0 \cap K_{m-1} = \{ e \}\text{,}
\end{equation*}
we have a composition series for \(H_{n-1}\text{.}\) Our induction hypothesis says that this series must be equivalent to the composition series
\begin{equation*}
H_{n-1} \supset \cdots \supset H_1 \supset H_0 = \{ e \}\text{.}
\end{equation*}
Hence, the composition series
\begin{equation*}
G = H_n \supset H_{n-1} \supset \cdots \supset H_1 \supset H_0 = \{ e \}
\end{equation*}
and
\begin{equation*}
G = H_n \supset H_{n-1} \supset H_{n-1} \cap K_{m-1} \supset \cdots \supset H_0 \cap K_{m-1} = \{ e \}
\end{equation*}
are equivalent. If \(H_{n-1} = K_{m-1}\text{,}\) then the composition series \(\{H_i \}\) and \(\{ K_j \}\) are equivalent and we are done; otherwise, \(H_{n-1} K_{m-1}\) is a normal subgroup of \(G\) properly containing \(H_{n-1}\text{.}\) In this case \(H_{n-1} K_{m-1} = G\) and we can apply the Second Isomorphism Theorem once again; that is,
\begin{equation*}
K_{m-1} / (K_{m-1} \cap H_{n-1}) \cong (H_{n-1} K_{m-1}) / H_{n-1} = G/H_{n-1}\text{.}
\end{equation*}
Therefore,
\begin{equation*}
G = H_n \supset H_{n-1} \supset H_{n-1} \cap K_{m-1} \supset \cdots \supset H_0 \cap K_{m-1} = \{ e \}
\end{equation*}
and
\begin{equation*}
G = K_m \supset K_{m-1} \supset K_{m-1} \cap H_{n-1} \supset \cdots \supset K_0 \cap H_{n-1} = \{ e \}
\end{equation*}
are equivalent and the proof of the theorem is complete.