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

Theorem pm2.86d 71
Description: Deduction based on pm2.86 69.
Hypothesis
Ref Expression
pm2.86d.1 |- (ph -> ((ps -> ch) -> (ps -> th)))
Assertion
Ref Expression
pm2.86d |- (ph -> (ps -> (ch -> th)))

Proof of Theorem pm2.86d
StepHypRef Expression
1 pm2.86d.1 . 2 |- (ph -> ((ps -> ch) -> (ps -> th)))
2 pm2.86 69 . 2 |- (((ps -> ch) -> (ps -> th)) -> (ps -> (ch -> th)))
31, 2syl 10 1 |- (ph -> (ps -> (ch -> th)))
Colors of variables: wff set class
Syntax hints:   -> wi 3
This theorem is referenced by:  pm5.74 583  ax15 1359  rcla4dv 1878  rcla4edv 1879  rcla4devOLD 10431
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-mp 7
Copyright terms: Public domain