Theorem notnotrd 134

Description: Deduction associated with notnotr 131 and notnotri 132. Double negation elimination rule. A translation of the natural deduction rule ¬ ¬ C , Γ⊢ ¬ ¬ 𝜓 ⇒ Γ⊢ 𝜓; see natded 30937. This is Definition NNC in [Pfenning] p. 17. This rule is valid in classical logic (our logic), but not in intuitionistic logic. (Contributed by DAW, 8-Feb-2017.)

Hypothesis

Ref	Expression
notnotrd.1	⊢ (𝜑 → ¬ ¬ 𝜓)

Assertion

Ref	Expression
notnotrd	⊢ (𝜑 → 𝜓)

Proof of Theorem notnotrd

Step	Hyp	Ref	Expression
1		notnotrd.1	. 2 ⊢ (𝜑 → ¬ ¬ 𝜓)
2		notnotr 131	. 2 ⊢ (¬ ¬ 𝜓 → 𝜓)
3	1, 2	syl 18	1 ⊢ (𝜑 → 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem is used by:  condan  830  ecase2d  1047  efald  1591  necon1ai  2982  supgtoreq  9441  konigthlem  10624  indpi  10963  sqrmo  15385  2sqcoprm  27725  axtgupdim2  28866  ncoltgdim2  28961  ex-natded5.13  30949  bnj1204  35576  knoppndvlem10  37309  hashnexinj  43098  supxrgere  46267  supxrgelem  46271  supxrge  46272  iccdifprioo  46450  icccncfext  46819  stirlinglem5  47010  sge0repnf  47318  sge0split  47341  nnfoctbdjlem  47387  nabctnabc  47923