Hard Replacement Rule Problem

P => (Q => R) is logically equivalent to Q => (P => R). This is known as commutativity of implications. However, unlike the other forms of commutativity, this replacement is not intuitively obvious. Fortunately, we can prove it is true using the replacement rules we have already learned. The challenge is figuring out how.

Back to Logic 101