## anonymous one year ago Need help on discrete math. I need to proof the bellow statement without using the true table. So can somebody walk me step by step please.

1. anonymous

|dw:1435952671366:dw|

2. anonymous

|dw:1435955364263:dw|

3. anonymous

$$\begin{array}{c|c} p & q & \neg p & p\lor q & \neg p\land(p\lor q) & (\neg p\land(p\lor q))\rightarrow q\\ \hline T & T & F & T & F & T \\ T & F & F & T & F & T \\ F & T & T & T & T & T \\ F & F & T & F & F & T \end{array}$$ so it's a tautology

4. anonymous

@oldrin.bataku without using the truth table

5. anonymous

it's a natural rule of deduction; what proof system are you using?