This chapter gives various applications of the theory developed in the previous chapters. The first application is a proof of generation of mouse full pointclasses assuming Strong Mouse Capturing. The second application is a proof that Strong Mouse Capturing holds in the minimal model of LSA; so the Mouse Set Conjecture is true in all models of AD^+ up to the minimal model of LSA. The third application is a proof of consistency of LSA from the existence of a Woodin limit of Woodin cardinals.