| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dedlem0b | Structured version Visualization version Unicode version | ||
| Description: Lemma for an alternate version of weak deduction theorem. (Contributed by NM, 2-Apr-1994.) |
| Ref | Expression |
|---|---|
| dedlem0b |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.21 120 |
. . . 4
| |
| 2 | 1 | imim2d 57 |
. . 3
|
| 3 | 2 | com23 86 |
. 2
|
| 4 | pm2.21 120 |
. . . . 5
| |
| 5 | simpr 477 |
. . . . 5
| |
| 6 | 4, 5 | imim12i 62 |
. . . 4
|
| 7 | 6 | con1d 139 |
. . 3
|
| 8 | 7 | com12 32 |
. 2
|
| 9 | 3, 8 | impbid 202 |
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-an 386 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |