| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference for combining cases. |
| Ref | Expression |
|---|---|
| ccase.1 |
|
| ccase.2 |
|
| ccase.3 |
|
| ccase.4 |
|
| Ref | Expression |
|---|---|
| ccase |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caselem 561 |
. 2
| |
| 2 | ccase.1 |
. . . 4
| |
| 3 | ccase.2 |
. . . 4
| |
| 4 | 2, 3 | jaoi 275 |
. . 3
|
| 5 | ccase.3 |
. . . 4
| |
| 6 | ccase.4 |
. . . 4
| |
| 7 | 5, 6 | jaoi 275 |
. . 3
|
| 8 | 4, 7 | jaoi 275 |
. 2
|
| 9 | 1, 8 | sylbi 174 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ccase2 564 addge0 4324 lt2sq 4414 nn0addclt 4551 nn0ltp1let 4556 |
| 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 |