Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ccased Structured version   Unicode version

Theorem ccased 915
 Description: Deduction for combining cases. (Contributed by NM, 9-May-2004.)
Hypotheses
Ref Expression
ccased.1
ccased.2
ccased.3
ccased.4
Assertion
Ref Expression
ccased

Proof of Theorem ccased
StepHypRef Expression
1 ccased.1 . . . 4
21com12 30 . . 3
3 ccased.2 . . . 4
43com12 30 . . 3
5 ccased.3 . . . 4
65com12 30 . . 3
7 ccased.4 . . . 4
87com12 30 . . 3
92, 4, 6, 8ccase 914 . 2
109com12 30 1
 Colors of variables: wff set class Syntax hints:   wi 4   wo 359   wa 360 This theorem is referenced by:  fpwwe2lem13  8522  mulge0  9550  zmulcl  10329  gcdabs  13038  pospo  14435  mulgass  14925  indistopon  17070  lgsdir2lem5  21116  outsideofeq  26069  smprngopr  26675  monotoddzzfi  27018  acongtr  27056  cdlemg33  31581 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 179  df-or 361  df-an 362
 Copyright terms: Public domain W3C validator