| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ecase23d | Structured version Visualization version Unicode version | ||
| Description: Deduction for elimination by cases. (Contributed by NM, 22-Apr-1994.) |
| Ref | Expression |
|---|---|
| ecase23d.1 |
|
| ecase23d.2 |
|
| ecase23d.3 |
|
| Ref | Expression |
|---|---|
| ecase23d |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecase23d.1 |
. . 3
| |
| 2 | ecase23d.2 |
. . 3
| |
| 3 | ioran 511 |
. . 3
| |
| 4 | 1, 2, 3 | sylanbrc 698 |
. 2
|
| 5 | ecase23d.3 |
. . . 4
| |
| 6 | 3orass 1040 |
. . . 4
| |
| 7 | 5, 6 | sylib 208 |
. . 3
|
| 8 | 7 | ord 392 |
. 2
|
| 9 | 4, 8 | mt3d 140 |
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 df-3or 1038 |
| This theorem is referenced by: tz7.7 5749 wfrlem10 7424 archiabllem2b 29750 nolt02o 31845 noresle 31846 nosupbnd1lem6 31859 nosupbnd2lem1 31861 |
| Copyright terms: Public domain | W3C validator |