Proving a tautology by applying a chain of logical identities

Question

I need help showing that $[ (p \land q) \Rightarrow (p \Rightarrow q) ]$ is a tautology by applying a chain of logical identities. The question also asks to identify each identity I use. I have no clue where to start.

Answer 1

You have to know that $(p \implies q) \iff (\neg p \lor q)$ (This can be proven by truth tables). Then, you begin start with $p \land q$, if that is true, then, $p$ and $q$ have to be true. $(p \land q) \implies q$

if $q$ is true, then, it doesn't matter if we ask if $q \lor r$ is true, because, we know it is, since $q$ is true. $q \implies (q \lor \neg p)$.

Since $\lor$ operator is conmutative $(q\lor \neg p) \iff (\neg p \lor q)$. Then, we have

$(p \land q) \implies q \implies (q \lor \neg p) \implies (\neg p \lor q)$

By transition $p\land q \implies \neg p \lor q$