Proving tautology

502 Views Asked by At

Trying to prove if this statement is a tautology:

$\neg (p\to q) \to p$

I can simplify the left hand side $\neg (p\to q)$ to $p\land \neg q$, but once I get there I'm stuck.

2

There are 2 best solutions below

0
On BEST ANSWER

Apply the equivalence of implication twice, then commute and associate so that you can apply identity rules.

$$\neg(p\to q)\to p \\= (p\to q) \vee p \\ = (\neg p \vee q)\vee p \\ \vdots$$

0
On

HINT (first 2 lines):

  1. Suppose $\neg[P\implies Q]$

  2. $\neg\neg[P\land \neg Q]$ (from 1)