Brute force works; it's not hard to enumerate all possible values of $(a,b)$ where $aRb$ is true or where $bRa$ is true, and those are the only values of $(a,b)$ where the implication could possibly be false.
(and because the implication is symmetric under swapping $a$ and $b$, it's enough just to consider the $(a,b)$ pairs where $aRb$ is true)
In more detail, if it turns out to be true, this would be a proof by cases: the two cases are "$aRb \wedge bRa$ is true" and "$aRb \wedge bRa$ is false". If you can show the implication is true in both cases, then the implication is true.
In the first case, you're essentially solving for all possible values of $(a,b)$ that make it true, and then checking the value of the implication.
Another way to arrange the same argument is to try and solve the equation "the implication is false". The first step of solving is that it is equivalent to the simultaneous system of two equations "$aRb \wedge bRa$ is true" and "a \neq b". If you continue solving and ultimately prove that there are no $(a,b)$ that satisfy this system, you've proven the implication is never false: i.e. that it's always true.