From the book Discrete Mathematics for Computing 2nd Edition in eBook:
I know how to perform the Euclidean Algorithm and GCM(a,b). I am however, deeply confused by this:
$$1 = 415 - 69(421 - 1 \times 415)$$ $$ = 70 \times 415 - 69 \times 421$$
How is this expression constructed $70 \times 415 - 69 \times 421$?
N.B. I am still new to this and learning, I am using the following book(s):
Discrete Mathematics for Computing / Edition 2
by Peter Grossman [eBook]
Discrete Mathematics for Computing / Edition 3
by Peter Grossman [Physical copy]

As far as I see, the calculations from the quotation concern to construct an integer solution $(x,y)$ of the Diophantine equation $2093x+836y=1$. To do this, we apply first the Euclidean algorithm to find the greatest common divisor to numbers $r_1=2093$ and $r_2=836$ and then go backwards. Namely, the Euclidean algorithm yields:
$r_3=421=2093-2\times 836=r_1-2\times r_2$
$r_4=415=836-1\times 421=r_2-1\times r_3$
$r_5=6=421-1\times 415=r_3-1\times r_4$
$r_6=1=415-69\times 6=r_4-69\times r_5$.
Next we go backwards:
$1=r_6=r_4-69\times r_5=415-69\times 6$
$1=r_4-69\times r_5=r_4-69\times (r_3-1\times r_4)=-69\times r_3+70\times r_4=-69\times 421+70\times 415$
$1=-69\times r_3+70\times r_4=-69\times r_3+70\times (r_2-1\times r_3)=70\times r_2-139\times r_3=70\times 836-139\times 421$
$1=70\times r_2-139\times r_3=70\times r_2-139\times (r_1-2\times r_2)=-139\times r_1+348\times r_2=-139\times 2093+348\times 836$
That is we constructed an integer solution $(x,y)=(-139,348)$ of the equation $2093x+836y=1$.