| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction for combining cases. |
| Ref | Expression |
|---|---|
| ccased.1 |
|
| ccased.2 |
|
| ccased.3 |
|
| ccased.4 |
|
| Ref | Expression |
|---|---|
| ccased |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ccased.1 |
. . . 4
| |
| 2 | ccased.2 |
. . . 4
| |
| 3 | 1, 2 | jaod 329 |
. . 3
|
| 4 | ccased.3 |
. . . 4
| |
| 5 | ccased.4 |
. . . 4
| |
| 6 | 4, 5 | jaod 329 |
. . 3
|
| 7 | 3, 6 | jaod 329 |
. 2
|
| 8 | caselem 561 |
. 2
| |
| 9 | 7, 8 | syl5ib 181 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: zaddclt 4590 zmulclt 4596 zltp1let 4597 |
| 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 |