They used $\ 1764\equiv 4\pmod{55}\ $ and the Congruence Product & Power Rules.. Ditto for $\, 4^{\large 13}\!\equiv 9.\ $
Generally congruence is preserved by replacing aguments of sums and products by any congruent argument, e.g. see the Polynomial Congruence Rule in the above linked answer.
I just don't know how to deal with a big number
CRT = Chinese Remainder Theorem helps by reducing to smaller moduli. Applying CRT here along with modular order reduction of exponents we obtain by easy mental arithmetic
$\!\bmod 5\!:\ \ \ \ \ \ \ \ \ \ 2^{\large 4} \equiv 1\, \Rightarrow\ 42^{\large 27}\ \ \equiv\ \ \ 2^{\large\color{#c00}{27}}\ \ \,\equiv\,\ \ 2^{\large\color{#c00} 3}\ \equiv\ \color{#0a0}3,\ \ $ by $\ \ \color{#c00}{27\equiv 3}\pmod{4}$
$\!\bmod 11\!:\,\ (-2)^{\large 5} \equiv 1\, \Rightarrow\, 42^{\large 27 }\equiv (-2)^{\large{27}} \equiv (-2)^{\large 2} \equiv \color{#90f}4,\, \ \ $ by $\ \ 27\equiv 2\pmod{5}$
Thus applying easy CRT: $ \ \ \ 42^{\large 27} \equiv \color{#90f}4 + 11\left[\dfrac{\color{#0a0}3-\color{#90f}4}{11} \bmod 5\right]\equiv 4+11[-1]\equiv -7\equiv 48\pmod{\!55}$
By reducing the moduli to $5$ & $11$ we can now do the arithmetic in a couple minutes purely mentally.