HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem jadOLD2 157
Description: Deduction form of ja 152. (Contributed by Scott Fenton, 13-Dec-2010.)
Hypotheses
Ref Expression
jad.1 |- (ph -> (-. ps -> th))
jad.2 |- (ph -> (ch -> th))
Assertion
Ref Expression
jadOLD2 |- (ph -> ((ps -> ch) -> th))

Proof of Theorem jadOLD2
StepHypRef Expression
1 jad.1 . . 3 |- (ph -> (-. ps -> th))
21imim2d 28 . 2 |- (ph -> (((ps -> ch) -> -. ps) -> ((ps -> ch) -> th)))
3 pm2.27 76 . . . 4 |- (ps -> ((ps -> ch) -> ch))
4 jad.2 . . . 4 |- (ph -> (ch -> th))
53, 4syl9r 72 . . 3 |- (ph -> (ps -> ((ps -> ch) -> th)))
6 simprim 155 . . 3 |- (-. ((ps -> ch) -> -. ps) -> ps)
75, 6syl5 20 . 2 |- (ph -> (-. ((ps -> ch) -> -. ps) -> ((ps -> ch) -> th)))
82, 7pm2.61d 141 1 |- (ph -> ((ps -> ch) -> th))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain