| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference for elimination by cases. |
| Ref | Expression |
|---|---|
| ecase3.1 |
|
| ecase3.2 |
|
| ecase3.3 |
|
| Ref | Expression |
|---|---|
| ecase3 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ioran 306 |
. . . 4
| |
| 2 | ecase3.3 |
. . . 4
| |
| 3 | 1, 2 | sylbir 201 |
. . 3
|
| 4 | 3 | ex 373 |
. 2
|
| 5 | ecase3.1 |
. 2
| |
| 6 | ecase3.2 |
. 2
| |
| 7 | 4, 5, 6 | pm2.61ii 130 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ecase3d 753 eueq3 1915 mdsym 10275 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 |