| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-andnotim | Structured version Visualization version Unicode version | ||
| Description: Two ways of expressing a certain ternary connective. Note the respective positions of the three formulas on each side of the biconditional. (Contributed by BJ, 6-Oct-2018.) |
| Ref | Expression |
|---|---|
| bj-andnotim |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imor 428 |
. . 3
| |
| 2 | iman 440 |
. . . . 5
| |
| 3 | 2 | biimpri 218 |
. . . 4
|
| 4 | 3 | orim1i 539 |
. . 3
|
| 5 | 1, 4 | sylbi 207 |
. 2
|
| 6 | pm2.24 121 |
. . . . 5
| |
| 7 | 6 | imim2i 16 |
. . . 4
|
| 8 | 7 | impd 447 |
. . 3
|
| 9 | ax-1 6 |
. . 3
| |
| 10 | 8, 9 | jaoi 394 |
. 2
|
| 11 | 5, 10 | impbii 199 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| 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 197 df-or 385 df-an 386 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |