ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ccase2 Unicode version

Theorem ccase2 873
Description: Inference for combining cases. (Contributed by NM, 29-Jul-1999.)
Hypotheses
Ref Expression
ccase2.1  |-  ( (
ph  /\  ps )  ->  ta )
ccase2.2  |-  ( ch 
->  ta )
ccase2.3  |-  ( th 
->  ta )
Assertion
Ref Expression
ccase2  |-  ( ( ( ph  \/  ch )  /\  ( ps  \/  th ) )  ->  ta )

Proof of Theorem ccase2
StepHypRef Expression
1 ccase2.1 . 2  |-  ( (
ph  /\  ps )  ->  ta )
2 ccase2.2 . . 3  |-  ( ch 
->  ta )
32adantr 261 . 2  |-  ( ( ch  /\  ps )  ->  ta )
4 ccase2.3 . . 3  |-  ( th 
->  ta )
54adantl 262 . 2  |-  ( (
ph  /\  th )  ->  ta )
64adantl 262 . 2  |-  ( ( ch  /\  th )  ->  ta )
71, 3, 5, 6ccase 871 1  |-  ( ( ( ph  \/  ch )  /\  ( ps  \/  th ) )  ->  ta )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    \/ wo 629
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630
This theorem depends on definitions:  df-bi 110
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator