Theorem notnotrdc 838

Description: Double negation elimination for a decidable proposition. The converse, notnot 624, holds for all propositions, not just decidable ones. This is Theorem *2.14 of [WhiteheadRussell] p. 102, but with a decidability condition added. (Contributed by Jim Kingdon, 11-Mar-2018.)

Assertion

Ref	Expression
notnotrdc	⊢ (DECID 𝜑 → (¬ ¬ 𝜑 → 𝜑))

Proof of Theorem notnotrdc

Step	Hyp	Ref	Expression
1		df-dc 830	. . 3 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
2		orcom 723	. . 3 ⊢ ((𝜑 ∨ ¬ 𝜑) ↔ (¬ 𝜑 ∨ 𝜑))
3	1, 2	bitri 183	. 2 ⊢ (DECID 𝜑 ↔ (¬ 𝜑 ∨ 𝜑))
4		pm2.53 717	. 2 ⊢ ((¬ 𝜑 ∨ 𝜑) → (¬ ¬ 𝜑 → 𝜑))
5	3, 4	sylbi 120	1 ⊢ (DECID 𝜑 → (¬ ¬ 𝜑 → 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 703  DECID wdc 829

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-in2 610  ax-io 704

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

This theorem is referenced by:  dcstab  839  notnotbdc  867  condandc  876  pm2.13dc  880  pm2.54dc  886  mkvprop  7134