The proof uses the fact that proper forcings are preserved under countable support iteration, and the fact that if  is supercompact, then there exists a Laver function for .
The proof utilizes the idea that proper forcings remain consistent when iterated with countable support, and that if a set is supercompact, it has a Laver function.