| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference for combining cases. |
| Ref | Expression |
|---|---|
| ccase2.1 |
|
| ccase2.2 |
|
| ccase2.3 |
|
| Ref | Expression |
|---|---|
| ccase2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ccase2.1 |
. 2
| |
| 2 | ccase2.2 |
. . 3
| |
| 3 | 2 | adantr 389 |
. 2
|
| 4 | ccase2.3 |
. . 3
| |
| 5 | 4 | adantl 388 |
. 2
|
| 6 | 4 | adantl 388 |
. 2
|
| 7 | 1, 3, 5, 6 | ccase 753 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: add20 5576 mulge0 5581 nn0mulcl 6069 bccl2t 6909 fctop 7592 cctop 7594 |
| 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 |