Conjunction and Implication

Theorems

 * $$p \and q \dashv \vdash \neg \left({p \implies \neg q}\right)$$
 * $$p \implies q \dashv \vdash \neg \left({p \and \neg q}\right)$$
 * $$p \and \neg q \dashv \vdash \neg \left({p \implies q}\right)$$

This rule is sometimes called Modus Ponendo Tollens (MPT):


 * $$p \implies \neg q \dashv \vdash \neg \left({p \and q}\right)$$

Proof by Natural Deduction
By the tableau method:

Proofs using the LEM
The remaining proofs depend (directly or indirectly) on the Law of the Excluded Middle.

Proof by Truth Table
We apply the Method of Truth Tables to the propositions in turn.

As can be seen by inspection, in all cases the truth values under the main connectives match for all models.

$$\begin{array}{|ccc||ccccc|} \hline p & \and & q & \neg & (p & \implies & \neg & q) \\ \hline F & F & F & F & F & T & T & F \\ F & F & T & F & F & T & F & T \\ T & F & F & F & T & T & T & F \\ T & T & T & T & T & F & F & T \\ \hline \end{array}$$

$$\begin{array}{|cccc||cccc|} \hline \neg & (p & \and & q) & p & \implies & \neg & q \\ \hline T & F & F & F & F & T & T & F \\ T & F & F & T & F & T & F & T \\ T & T & F & F & T & T & T & F \\ F & T & T & T & T & F & F & T \\ \hline \end{array}$$

$$\begin{array}{|ccc||ccccc|} \hline p & \implies & q & \neg & (p & \and & \neg & q) \\ \hline F & T & F & T & F & F & T & F \\ F & T & T & T & F & F & F & T \\ T & F & F & F & T & T & T & F \\ T & T & T & T & T & F & F & T \\ \hline \end{array}$$

$$\begin{array}{|cccc||cccc|} \hline \neg & (p & \implies & q) & p & \and & \neg & q \\ \hline F & F & T & F & F & F & T & F \\ F & F & T & T & F & F & F & T \\ T & T & F & F & T & T & T & F \\ F & T & T & T & T & F & F & T \\ \hline \end{array}$$