| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction for elimination by cases. |
| Ref | Expression |
|---|---|
| ecased.1 |
|
| ecased.2 |
|
| ecased.3 |
|
| Ref | Expression |
|---|---|
| ecased |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecased.2 |
. . . 4
| |
| 2 | ecased.3 |
. . . 4
| |
| 3 | 1, 2 | jca 236 |
. . 3
|
| 4 | ioran 254 |
. . 3
| |
| 5 | 3, 4 | sylibr 175 |
. 2
|
| 6 | ecased.1 |
. . . 4
| |
| 7 | 3orass 584 |
. . . 4
| |
| 8 | 6, 7 | sylib 173 |
. . 3
|
| 9 | 8 | ord 202 |
. 2
|
| 10 | 5, 9 | mt3d 101 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: tz7.7 2224 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 |