Theorem rbsyl 1789

Description: Used to rederive the Lukasiewicz axioms from Russell-Bernays'. (Contributed by Anthony Hart, 18-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
rbsyl.1	⊢ (¬ 𝜓 ∨ 𝜒)
rbsyl.2	⊢ (𝜑 ∨ 𝜓)

Assertion

Ref	Expression
rbsyl	⊢ (𝜑 ∨ 𝜒)

Proof of Theorem rbsyl

Step	Hyp	Ref	Expression
1		rbsyl.2	. 2 ⊢ (𝜑 ∨ 𝜓)
2		rbsyl.1	. . 3 ⊢ (¬ 𝜓 ∨ 𝜒)
3		rb-ax1 1785	. . 3 ⊢ (¬ (¬ 𝜓 ∨ 𝜒) ∨ (¬ (𝜑 ∨ 𝜓) ∨ (𝜑 ∨ 𝜒)))
4	2, 3	anmp 1784	. 2 ⊢ (¬ (𝜑 ∨ 𝜓) ∨ (𝜑 ∨ 𝜒))
5	1, 4	anmp 1784	1 ⊢ (𝜑 ∨ 𝜒)

This proof depends on syntax axioms:  ¬ wn 3   ∨ 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:  rblem1  1790  rblem2  1791  rblem3  1792  rblem4  1793  rblem5  1794  rblem6  1795  re2luk1  1798  re2luk2  1799  re2luk3  1800