Theorem re2luk3 1800

Description: luk-3 1690 derived from Russell-Bernays'.

This theorem, along with re1axmp 1797, re2luk1 1798, and re2luk2 1799 shows that rb-ax1 1785, rb-ax2 1786, rb-ax3 1787, and rb-ax4 1788, along with anmp 1784, can be used as a complete axiomatization of propositional calculus. (Contributed by Anthony Hart, 19-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
re2luk3	⊢ (𝜑 → (¬ 𝜑 → 𝜓))

Proof of Theorem re2luk3

Step	Hyp	Ref	Expression
1		rb-imdf 1783	. . . 4 ⊢ ¬ (¬ (¬ (¬ 𝜑 → 𝜓) ∨ (¬ ¬ 𝜑 ∨ 𝜓)) ∨ ¬ (¬ (¬ ¬ 𝜑 ∨ 𝜓) ∨ (¬ 𝜑 → 𝜓)))
2	1	rblem7 1796	. . 3 ⊢ (¬ (¬ ¬ 𝜑 ∨ 𝜓) ∨ (¬ 𝜑 → 𝜓))
3		rb-ax4 1788	. . . . . 6 ⊢ (¬ (¬ 𝜑 ∨ ¬ 𝜑) ∨ ¬ 𝜑)
4		rb-ax3 1787	. . . . . 6 ⊢ (¬ ¬ 𝜑 ∨ (¬ 𝜑 ∨ ¬ 𝜑))
5	3, 4	rbsyl 1789	. . . . 5 ⊢ (¬ ¬ 𝜑 ∨ ¬ 𝜑)
6		rb-ax2 1786	. . . . 5 ⊢ (¬ (¬ ¬ 𝜑 ∨ ¬ 𝜑) ∨ (¬ 𝜑 ∨ ¬ ¬ 𝜑))
7	5, 6	anmp 1784	. . . 4 ⊢ (¬ 𝜑 ∨ ¬ ¬ 𝜑)
8		rblem2 1791	. . . 4 ⊢ (¬ (¬ 𝜑 ∨ ¬ ¬ 𝜑) ∨ (¬ 𝜑 ∨ (¬ ¬ 𝜑 ∨ 𝜓)))
9	7, 8	anmp 1784	. . 3 ⊢ (¬ 𝜑 ∨ (¬ ¬ 𝜑 ∨ 𝜓))
10	2, 9	rbsyl 1789	. 2 ⊢ (¬ 𝜑 ∨ (¬ 𝜑 → 𝜓))
11		rb-imdf 1783	. . 3 ⊢ ¬ (¬ (¬ (𝜑 → (¬ 𝜑 → 𝜓)) ∨ (¬ 𝜑 ∨ (¬ 𝜑 → 𝜓))) ∨ ¬ (¬ (¬ 𝜑 ∨ (¬ 𝜑 → 𝜓)) ∨ (𝜑 → (¬ 𝜑 → 𝜓))))
12	11	rblem7 1796	. 2 ⊢ (¬ (¬ 𝜑 ∨ (¬ 𝜑 → 𝜓)) ∨ (𝜑 → (¬ 𝜑 → 𝜓)))
13	10, 12	anmp 1784	1 ⊢ (𝜑 → (¬ 𝜑 → 𝜓))

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

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862

This theorem is used by: (None)