Verifying RSA decryption equation

I was reading Wikipedia on RSA algorithm for asymmetric key encryption. At first, with the absence of a lengthy proof, the decryption equation seemed like magic. I tried to verify quickly that raising the encrypted message (cipher) to the exponent and then doing a modulus with n will return the original message. I am posting my result below.