Theorem notnotrdc 855

Description: Double negation elimination for a decidable proposition. The converse, notnot 638, 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 847	. . 3 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
2		orcom 740	. . 3 ⊢ ((𝜑 ∨ ¬ 𝜑) ↔ (¬ 𝜑 ∨ 𝜑))
3	1, 2	bitri 184	. 2 ⊢ (DECID 𝜑 ↔ (¬ 𝜑 ∨ 𝜑))
4		pm2.53 734	. 2 ⊢ ((¬ 𝜑 ∨ 𝜑) → (¬ ¬ 𝜑 → 𝜑))
5	3, 4	sylbi 121	1 ⊢ (DECID 𝜑 → (¬ ¬ 𝜑 → 𝜑))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 720  DECID wdc 846

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in2 624  ax-io 721

This proof depends on definitions:  df-bi 117  df-dc 847

This theorem is used by:  dcstab  856  notnotbdc  884  condandc  893  pm2.13dc  897  pm2.54dc  903  mkvprop  7499  netap  7621  bitsfzo  12741  ballotfilemic  13302  bpos  16281  exmidnotnotr  17202