Double Negation/Double Negation Elimination/Sequent Form/Formulation 2

Theorem

 * $\vdash \neg \neg p \implies p$

Proof
By the tableau method of natural deduction:

Also see

 * Double Negation Elimination implies Law of Excluded Middle

Comment
As we see, the use of the Law of the Excluded Middle invalidates the Law of Double Negation Elimination from the intuitionist system.

Notice the difference between Double Negation Elimination and Double Negation Introduction, whereby it can be seen to be "intuitively obvious" that if a statement is true, then it is not the case that it is not true. However, if all we know is that a statement is not "not-true", we can not be certain that it is true without accepting that there are only two possible truth values. Such distinctions may be important when considering, for example, multi-value logic.

However, when analysing logic from a purely classical standpoint, it is common and acceptable to make the simplification of taking just one Double Negation rule:
 * $p \dashv \vdash \neg \neg p$