[step:Use the Whitehead block identity to make inverse block pairs elementary]
Let $A\in GL_n(R)$, and let $I_n\in GL_n(R)$ denote the identity matrix. Throughout this step, $R^n$ denotes the free left $R$-module of column vectors, and matrices act on $R^n$ by left multiplication. Define maps $U_A,L_A,P:R^n\oplus R^n\to R^n\oplus R^n$ by
\begin{align*}
U_A(x,y)=(x+Ay,y)
\end{align*}
for $x,y\in R^n$,
\begin{align*}
L_A(x,y)=(x,y-A^{-1}x)
\end{align*}
for $x,y\in R^n$, and
\begin{align*}
P(x,y)=(-y,x)
\end{align*}
for $x,y\in R^n$. Write $A=(a_{pq})_{1\leq p,q\leq n}$. With respect to the ordered decomposition $R^n\oplus R^n$, the map $U_A$ has block matrix
\begin{align*}
\begin{pmatrix} I_n & A
\end{align*}
\begin{align*}
0 & I_n \end{pmatrix}.
\end{align*}
For each pair $(p,q)$ with $1\leq p,q\leq n$, let $T_{pq}$ be the elementary matrix in $GL_{2n}(R)$ that adds $a_{pq}$ times the $q$-th coordinate in the second copy of $R^n$ to the $p$-th coordinate in the first copy. In matrix notation, $T_{pq}=e_{p,n+q}(a_{pq})$. Since all these elementary matrices have their nonzero off-diagonal entries in the upper-right block, their off-diagonal matrix units multiply to zero; hence their product, in any fixed order, is exactly $U_A$. Thus $U_A\in E(R)$. Applying the same argument to the entries of $-A^{-1}$ in the lower-left block gives $L_A\in E(R)$.
The map $P$ is elementary because it is the composite of the three elementary block transvections
\begin{align*}
(x,y)\mapsto (x,y+x),
\qquad
(x,y)\mapsto (x-y,y),
\qquad
(x,y)\mapsto (x,y+x).
\end{align*}
Their composite sends $(x,y)$ first to $(x,y+x)$, then to $(-y,y+x)$, and finally to $(-y,x)$, so it is $P$.
For $x,y\in R^n$, direct multiplication of these four maps gives
\begin{align*}
(U_A L_A U_A P)(x,y)=(Ax,A^{-1}y).
\end{align*}
Therefore $U_A L_A U_A P=\operatorname{diag}(A,A^{-1})$. Since $E(R)$ is a subgroup and each factor lies in $E(R)$, we obtain
\begin{align*}
\operatorname{diag}(A,A^{-1})\in E(R).
\end{align*}
[/step]