Theorem nndc 837

Description: Double negation of decidability of a formula. Intuitionistic logic refutes undecidability (but does not prove decidability) of any formula. (Contributed by BJ, 9-Oct-2019.)

Assertion

Ref	Expression
nndc	⊢ ¬ ¬ DECID 𝜑

Proof of Theorem nndc

Step	Hyp	Ref	Expression
1		nnexmid 836	. 2 ⊢ ¬ ¬ (𝜑 ∨ ¬ 𝜑)
2		df-dc 821	. . 3 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
3	2	notbii 658	. 2 ⊢ (¬ DECID 𝜑 ↔ ¬ (𝜑 ∨ ¬ 𝜑))
4	1, 3	mtbir 661	1 ⊢ ¬ ¬ DECID 𝜑

Syntax hints:  ¬ wn 3   ∨ wo 698  DECID wdc 820

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699

This theorem depends on definitions:  df-bi 116  df-dc 821

This theorem is referenced by:  bj-nnst  13135  bj-dcdc  13136  bj-stdc  13137