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

Theorem ecase 909
Description: Inference for elimination by cases. (Contributed by NM, 13-Jul-2005.)
Hypotheses
Ref Expression
ecase.1  |-  ( -. 
ph  ->  ch )
ecase.2  |-  ( -. 
ps  ->  ch )
ecase.3  |-  ( (
ph  /\  ps )  ->  ch )
Assertion
Ref Expression
ecase  |-  ch

Proof of Theorem ecase
StepHypRef Expression
1 ecase.3 . . 3  |-  ( (
ph  /\  ps )  ->  ch )
21ex 424 . 2  |-  ( ph  ->  ( ps  ->  ch ) )
3 ecase.1 . 2  |-  ( -. 
ph  ->  ch )
4 ecase.2 . 2  |-  ( -. 
ps  ->  ch )
52, 3, 4pm2.61nii 160 1  |-  ch
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359
This theorem is referenced by:  elfiun  7370  hashprb  11595  txindislem  17586  1to3vfriswmgra  27760
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 178  df-an 361
  Copyright terms: Public domain W3C validator