Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ccased | Structured version Visualization version 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 32 | . . 3 |
3 | ccased.2 | . . . 4 | |
4 | 3 | com12 32 | . . 3 |
5 | ccased.3 | . . . 4 | |
6 | 5 | com12 32 | . . 3 |
7 | ccased.4 | . . . 4 | |
8 | 7 | com12 32 | . . 3 |
9 | 2, 4, 6, 8 | ccase 987 | . 2 |
10 | 9 | com12 32 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wo 383 wa 384 |
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 197 df-or 385 df-an 386 |
This theorem is referenced by: fpwwe2lem13 9464 mulge0 10546 zmulcl 11426 gcdabs 15250 lcmabs 15318 pospo 16973 mulgass 17579 indistopon 20805 lgsdir2lem5 25054 outsideofeq 32237 smprngopr 33851 cdlemg33 35999 monotoddzzfi 37507 acongtr 37545 |
Copyright terms: Public domain | W3C validator |