| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dedlema | Structured version Visualization version Unicode version | ||
| Description: Lemma for weak deduction theorem. See also ifptru 1023. (Contributed by NM, 26-Jun-2002.) (Proof shortened by Andrew Salmon, 7-May-2011.) |
| Ref | Expression |
|---|---|
| dedlema |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orc 400 |
. . 3
| |
| 2 | 1 | expcom 451 |
. 2
|
| 3 | simpl 473 |
. . . 4
| |
| 4 | 3 | a1i 11 |
. . 3
|
| 5 | pm2.24 121 |
. . . 4
| |
| 6 | 5 | adantld 483 |
. . 3
|
| 7 | 4, 6 | jaod 395 |
. 2
|
| 8 | 2, 7 | 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-or 385 df-an 386 |
| This theorem is referenced by: pm4.42 1004 elimhOLD 1033 dedtOLD 1034 |
| Copyright terms: Public domain | W3C validator |