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

Theorem pm5.41 169
Description: Theorem *5.41 of [WhiteheadRussell] p. 125.
Assertion
Ref Expression
pm5.41 |- (((ph -> ps) -> (ph -> ch)) <-> (ph -> (ps -> ch)))

Proof of Theorem pm5.41
StepHypRef Expression
1 pm2.86 69 . 2 |- (((ph -> ps) -> (ph -> ch)) -> (ph -> (ps -> ch)))
2 ax-2 5 . 2 |- ((ph -> (ps -> ch)) -> ((ph -> ps) -> (ph -> ch)))
31, 2impbi 157 1 |- (((ph -> ps) -> (ph -> ch)) <-> (ph -> (ps -> ch)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147
Copyright terms: Public domain