![]() |
New Foundations Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > NFE Home > Th. List > ccase2 | Unicode version |
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.) |
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 451 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | ccase2.3 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 4 | adantl 452 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 4 | adantl 452 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 1, 3, 5, 6 | ccase 912 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff setvar class |
Syntax hints: ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |