| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Lukasiewicz's shortest axiom for equivalential calculus. Storrs McCall, ed., Polish Logic 1920-1939 (Oxford, 1967), p. 96. |
| Ref | Expression |
|---|---|
| biluk |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bicom 398 |
. . . . 5
| |
| 2 | biass 511 |
. . . . 5
| |
| 3 | 1, 2 | mpbi 164 |
. . . 4
|
| 4 | 3 | bibi2i 460 |
. . 3
|
| 5 | bicom 398 |
. . 3
| |
| 6 | biass 511 |
. . 3
| |
| 7 | 4, 5, 6 | 3bitr4 158 |
. 2
|
| 8 | bicom 398 |
. . 3
| |
| 9 | bicom 398 |
. . 3
| |
| 10 | 8, 9 | bibi12i 462 |
. 2
|
| 11 | 7, 10 | bitr 151 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 |