| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference for elimination by cases. |
| Ref | Expression |
|---|---|
| 3ecase.1 |
|
| 3ecase.2 |
|
| 3ecase.3 |
|
| 3ecase.4 |
|
| Ref | Expression |
|---|---|
| 3ecase |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3ecase.4 |
. . . 4
| |
| 2 | 1 | 3exp 829 |
. . 3
|
| 3 | 3ecase.1 |
. . . . 5
| |
| 4 | 3 | a1d 12 |
. . . 4
|
| 5 | 4 | a1d 12 |
. . 3
|
| 6 | 2, 5 | pm2.61i 126 |
. 2
|
| 7 | 3ecase.2 |
. 2
| |
| 8 | 3ecase.3 |
. 2
| |
| 9 | 6, 7, 8 | pm2.61nii 131 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: bcpasc 6858 |
| 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-an 225 df-3an 774 |