Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  rblem5 Structured version   Unicode version

Theorem rblem5 1579
 Description: Used to rederive the Lukasiewicz axioms from Russell-Bernays'. (Contributed by Anthony Hart, 19-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rblem5

Proof of Theorem rblem5
StepHypRef Expression
1 rb-ax2 1571 . 2
2 rb-ax4 1573 . . . . 5
3 rb-ax3 1572 . . . . 5
42, 3rbsyl 1574 . . . 4
5 rb-ax4 1573 . . . . . . 7
6 rb-ax3 1572 . . . . . . 7
75, 6rbsyl 1574 . . . . . 6
8 rb-ax2 1571 . . . . . 6
97, 8anmp 1569 . . . . 5
109, 4rblem1 1575 . . . 4
114, 10anmp 1569 . . 3
12 rb-ax4 1573 . . . . 5
13 rb-ax3 1572 . . . . 5
1412, 13rbsyl 1574 . . . 4
15 rb-ax2 1571 . . . 4
1614, 15anmp 1569 . . 3
1711, 16rblem1 1575 . 2
181, 17rbsyl 1574 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wo 368 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371 This theorem is referenced by:  rblem6  1580  rblem7  1581
 Copyright terms: Public domain W3C validator