Theorem nnexmid 857

Description: Double negation of decidability of a formula. See also comment of nndc 858 to avoid a pitfall that could come from the label "nnexmid". This theorem can also be proved from bj-nnor 16351 as in bj-nndcALT 16375. (Contributed by BJ, 9-Oct-2019.)

Assertion

Ref	Expression
nnexmid	⊢ ¬ ¬ (𝜑 ∨ ¬ 𝜑)

Proof of Theorem nnexmid

Step	Hyp	Ref	Expression
1		pm3.24 700	. 2 ⊢ ¬ (¬ 𝜑 ∧ ¬ ¬ 𝜑)
2		ioran 759	. 2 ⊢ (¬ (𝜑 ∨ ¬ 𝜑) ↔ (¬ 𝜑 ∧ ¬ ¬ 𝜑))
3	1, 2	mtbir 677	1 ⊢ ¬ ¬ (𝜑 ∨ ¬ 𝜑)

Syntax hints:  ¬ wn 3   ∧ wa 104   ∨ wo 715

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  nndc  858  dcfromnotnotr  1492  dcfromcon  1493  exmid1stab  4298