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

Theorem ccase 914
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.) (Proof shortened by Wolf Lammen, 6-Jan-2013.)
Hypotheses
Ref Expression
ccase.1  |-  ( (
ph  /\  ps )  ->  ta )
ccase.2  |-  ( ( ch  /\  ps )  ->  ta )
ccase.3  |-  ( (
ph  /\  th )  ->  ta )
ccase.4  |-  ( ( ch  /\  th )  ->  ta )
Assertion
Ref Expression
ccase  |-  ( ( ( ph  \/  ch )  /\  ( ps  \/  th ) )  ->  ta )

Proof of Theorem ccase
StepHypRef Expression
1 ccase.1 . . 3  |-  ( (
ph  /\  ps )  ->  ta )
2 ccase.2 . . 3  |-  ( ( ch  /\  ps )  ->  ta )
31, 2jaoian 761 . 2  |-  ( ( ( ph  \/  ch )  /\  ps )  ->  ta )
4 ccase.3 . . 3  |-  ( (
ph  /\  th )  ->  ta )
5 ccase.4 . . 3  |-  ( ( ch  /\  th )  ->  ta )
64, 5jaoian 761 . 2  |-  ( ( ( ph  \/  ch )  /\  th )  ->  ta )
73, 6jaodan 762 1  |-  ( ( ( ph  \/  ch )  /\  ( ps  \/  th ) )  ->  ta )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 359    /\ wa 360
This theorem is referenced by:  ccased  915  ccase2  916  undif3  3604  injresinjlem  11201  nn0gcdsq  13146  prodmo  25264  kelac2lem  27141  cnmsgnsubg  27413
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362
  Copyright terms: Public domain W3C validator