I looking for some explanation on how to prove a equation a tautolgies. I can quite easl do this using turth table. But when i try to do this using equation i get a bit stuck.
So for example if i had a problem like as follow
(r ⇒ (p ∧ q)) ⇔ ((r ⇒ p) ∧ (r ⇒ q))
I know this is not tautology but what am i suppose to prove to be tautoloy. Should the end verdict be
(r ⇒ (p ∧ q)) ⇔ ((r ⇒ p) ∧ (r ⇒ q)) <-> TRUE.
Is this is what am i need to show using rule of inference? Please point me to the right direction.