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

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

Proof of Theorem 3ecase
StepHypRef Expression
1 3ecase.4 . . . 4  |-  ( (
ph  /\  ps  /\  ch )  ->  th )
213exp 1264 . . 3  |-  ( ph  ->  ( ps  ->  ( ch  ->  th ) ) )
3 3ecase.1 . . . 4  |-  ( -. 
ph  ->  th )
432a1d 26 . . 3  |-  ( -. 
ph  ->  ( ps  ->  ( ch  ->  th )
) )
52, 4pm2.61i 176 . 2  |-  ( ps 
->  ( ch  ->  th )
)
6 3ecase.2 . 2  |-  ( -. 
ps  ->  th )
7 3ecase.3 . 2  |-  ( -. 
ch  ->  th )
85, 6, 7pm2.61nii 178 1  |-  th
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ w3a 1037
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 197  df-an 386  df-3an 1039
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator