In this talk, we will show a general method for constructively proving the existence of localized patterns in a class of semilinear autonomous partial differential equations (PDEs) posed on unbounded domains along with any symmetry they may possess. We will summarize our main approach for proving solutions on unbounded domains. We use a Newton-Kantorovich argument involving quantities to estimate partially by hand and partially on the computer. This makes our approach computer assisted. Following this, we will discuss previous methods that use computer assisted proofs (CAPs) for proving certain symmetries of solutions using Fourier series. Combining these methods can lead to proofs of some symmetries of localized patterns, but not all possible symmetries. The goal of this talk is to bridge this gap and demonstrate our general approach for proving any symmetry. This will include the construction of the approximate solution, approximate inverse, and the necessary Newton-Kantorovich argument. We will use dihedral symmetries in the 2D Swift Hohenberg PDE as our example. To conclude, we will discuss future improvements we would like to investigate with regards to the method.