| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction for elimination by cases. |
| Ref | Expression |
|---|---|
| ecase3d.1 |
|
| ecase3d.2 |
|
| ecase3d.3 |
|
| Ref | Expression |
|---|---|
| ecase3d |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecase3d.1 |
. . 3
| |
| 2 | 1 | com12 11 |
. 2
|
| 3 | ecase3d.2 |
. . 3
| |
| 4 | 3 | com12 11 |
. 2
|
| 5 | ecase3d.3 |
. . 3
| |
| 6 | 5 | com12 11 |
. 2
|
| 7 | 2, 4, 6 | ecase3 751 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: distrlem4pr 5117 atcvat4 10315 |
| 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 |