Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj1051 12890
Description: First-order logic and set theory.
Hypothesis
Ref Expression
bnj1051.1 |- (ph -> (ps -> ch))
Assertion
Ref Expression
bnj1051 |- ((ps -> ph) -> (ps -> ch))

Proof of Theorem bnj1051
StepHypRef Expression
1 bnj1051.1 . 2 |- (ph -> (ps -> ch))
2 id 73 . 2 |- (ps -> ps)
31, 2bnj1050 12889 1 |- ((ps -> ph) -> (ps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3
This theorem is referenced by:  bnj1533 13182
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 164  df-an 242
Copyright terms: Public domain