Double Negation/Double Negation Elimination/Sequent Form/Formulation 1/Proof

Theorem

 * $\neg \neg p \vdash p$

Proof

 * align="right" | 2 ||
 * align="right" | (None)
 * $p \lor \neg p$
 * LEM
 * (None)
 * (None)

Also see

 * Double Negation Elimination implies Law of Excluded Middle