merlem13 - Metamath Proof Explorer

Metamath Proof Explorer

< Previous Next >
Related theorems
Unicode version

Theorem merlem13 934

Description: Step 35 of Meredith's proof of Lukasiewicz axioms from his sole axiom.

**Assertion**
Ref	Expression
merlem13

**Proof of Theorem merlem13**
Step	Hyp	Ref	Expression
1		merlem12 933	. . . . 5
2		merlem12 933	. . . . . . . 8
3		merlem5 926	. . . . . . . 8
4	2, 3	ax-mp 7	. . . . . . 7
5		merlem6 927	. . . . . . 7
6	4, 5	ax-mp 7	. . . . . 6
7		meredith 921	. . . . . 6
8	6, 7	ax-mp 7	. . . . 5
9	1, 8	ax-mp 7	. . . 4
10		merlem6 927	. . . 4
11	9, 10	ax-mp 7	. . 3
12		merlem11 932	. . 3
13	11, 12	ax-mp 7	. 2
14		meredith 921	. 2
15	13, 14	ax-mp 7	1

Colors of variables: wff set class

Syntax hints:

wn 2

wi 3

This theorem is referenced by: luk-1 935

This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7