How can I show logically equivalence without a truth table Show that $(p \rightarrow q) \wedge (p \rightarrow r)$ and $p \rightarrow (q \wedge r)$ are logically equivalent.
I tried to do this making a truth table but I think my teacher wants me to solve it using the different laws of Logical Equivalences.
Can anyone help me? 

Here is an approach 
$$(p \to q) \wedge (p \to r) \equiv (\neg p \vee q) \wedge (\neg p \vee r) \equiv \neg p \vee (q \wedge r) \equiv p \to (q \wedge r)$$
