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

Theorem ccase2 948
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.)
Hypotheses
Ref Expression
ccase2.1
ccase2.2
ccase2.3
Assertion
Ref Expression
ccase2

Proof of Theorem ccase2
StepHypRef Expression
1 ccase2.1 . 2
2 ccase2.2 . . 3
32adantr 465 . 2
4 ccase2.3 . . 3
54adantl 466 . 2
64adantl 466 . 2
71, 3, 5, 6ccase 946 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  \/wo 368  /\wa 369
This theorem is referenced by:  fctop  19505  cctop  19507
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
  Copyright terms: Public domain W3C validator