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

Theorem exp4d 367
Description: An exportation inference. (Contributed by NM, 26-Apr-1994.)
Hypothesis
Ref Expression
exp4d.1  |-  ( ph  ->  ( ( ps  /\  ( ch  /\  th )
)  ->  ta )
)
Assertion
Ref Expression
exp4d  |-  ( ph  ->  ( ps  ->  ( ch  ->  ( th  ->  ta ) ) ) )

Proof of Theorem exp4d
StepHypRef Expression
1 exp4d.1 . . 3  |-  ( ph  ->  ( ( ps  /\  ( ch  /\  th )
)  ->  ta )
)
21expd 256 . 2  |-  ( ph  ->  ( ps  ->  (
( ch  /\  th )  ->  ta ) ) )
32exp4a 364 1  |-  ( ph  ->  ( ps  ->  ( ch  ->  ( th  ->  ta ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  tfrlem9  6298  facdiv  10672  infpnlem1  12311
  Copyright terms: Public domain W3C validator