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

Theorem ccase 946
 Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.) (Proof shortened by Wolf Lammen, 6-Jan-2013.)
Hypotheses
Ref Expression
ccase.1
ccase.2
ccase.3
ccase.4
Assertion
Ref Expression
ccase

Proof of Theorem ccase
StepHypRef Expression
1 ccase.1 . . 3
2 ccase.2 . . 3
31, 2jaoian 784 . 2
4 ccase.3 . . 3
5 ccase.4 . . 3
64, 5jaoian 784 . 2
73, 6jaodan 785 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wo 368   wa 369 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 185  df-or 370  df-an 371 This theorem is referenced by:  ccased  947  ccase2  948  undif3  3766  injresinjlem  11927  hash2prd  12521  prodmo  13754  nn0gcdsq  14296  symgextf1  16572  cnmsgnsubg  18739  kelac2lem  31172
 Copyright terms: Public domain W3C validator