Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ccase | Unicode version |
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.) (Proof shortened by Wolf Lammen, 6-Jan-2013.) |
Ref | Expression |
---|---|
ccase.1 | |
ccase.2 | |
ccase.3 | |
ccase.4 |
Ref | Expression |
---|---|
ccase |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ccase.1 | . . 3 | |
2 | ccase.2 | . . 3 | |
3 | 1, 2 | jaoian 785 | . 2 |
4 | ccase.3 | . . 3 | |
5 | ccase.4 | . . 3 | |
6 | 4, 5 | jaoian 785 | . 2 |
7 | 3, 6 | jaodan 787 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wo 698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: ccased 955 ccase2 956 undif3ss 3383 prodmodc 11519 nn0gcdsq 12132 |
Copyright terms: Public domain | W3C validator |