The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the argument is the derivation of self-consistent equations and a microscopic version of the loop equations for random $d$-regular graphs. We first recall the local law for random $d$-regular graphs, and then illustrate the main ideas behind the derivation of the self-consistent equations and the first loop equation.