MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bitr Unicode version

Theorem bitr 690
Description: Theorem *4.22 of [WhiteheadRussell] p. 117. (Contributed by NM, 3-Jan-2005.)
Assertion
Ref Expression
bitr  |-  ( ( ( ph  <->  ps )  /\  ( ps  <->  ch )
)  ->  ( ph  <->  ch ) )

Proof of Theorem bitr
StepHypRef Expression
1 bibi1 318 . 2  |-  ( (
ph 
<->  ps )  ->  (
( ph  <->  ch )  <->  ( ps  <->  ch ) ) )
21biimpar 472 1  |-  ( ( ( ph  <->  ps )  /\  ( ps  <->  ch )
)  ->  ( ph  <->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359
This theorem is referenced by:  opelopabt  4459  domunfican  7370  albitr  27473  3orbi123VD  28816
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 178  df-an 361
  Copyright terms: Public domain W3C validator