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

Theorem bitr 684
Description: Theorem *4.22 of [WhiteheadRussell] p. 117.
Assertion
Ref Expression
bitr |- (((ph <-> ps) /\ (ps <-> ch)) -> (ph <-> ch))

Proof of Theorem bitr
StepHypRef Expression
1 id 73 . . 3 |- ((ph <-> ps) -> (ph <-> ps))
21bibi1d 681 . 2 |- ((ph <-> ps) -> ((ph <-> ch) <-> (ps <-> ch)))
32biimpar 461 1 |- (((ph <-> ps) /\ (ps <-> ch)) -> (ph <-> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240
This theorem is referenced by:  absdvdsb 13673  dvdsabsb 13674  albitr 16310  3orbi123VD 16674
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