Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ccased | Unicode version |
Description: Deduction for combining cases. (Contributed by NM, 9-May-2004.) |
Ref | Expression |
---|---|
ccased.1 | |
ccased.2 | |
ccased.3 | |
ccased.4 |
Ref | Expression |
---|---|
ccased |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ccased.1 | . . . 4 | |
2 | 1 | com12 27 | . . 3 |
3 | ccased.2 | . . . 4 | |
4 | 3 | com12 27 | . . 3 |
5 | ccased.3 | . . . 4 | |
6 | 5 | com12 27 | . . 3 |
7 | ccased.4 | . . . 4 | |
8 | 7 | com12 27 | . . 3 |
9 | 2, 4, 6, 8 | ccase 871 | . 2 |
10 | 9 | com12 27 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wo 629 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 |
This theorem depends on definitions: df-bi 110 |
This theorem is referenced by: zmulcl 8297 |
Copyright terms: Public domain | W3C validator |