Theorem 3bitrri 207

Description: A chained inference from transitive law for logical equivalence. (Contributed by NM, 4-Aug-2006.)

Hypotheses

Ref	Expression
3bitri.1	|- ( ph <-> ps )
3bitri.2	|- ( ps <-> ch )
3bitri.3	|- ( ch <-> th )

Assertion

Ref	Expression
3bitrri	|- ( th <-> ph )

Proof of Theorem 3bitrri

Step	Hyp	Ref	Expression
1		3bitri.3	. 2 |- ( ch <-> th )
2		3bitri.1	. . 3 |- ( ph <-> ps )
3		3bitri.2	. . 3 |- ( ps <-> ch )
4	2, 3	bitr2i 185	. 2 |- ( ch <-> ph )
5	1, 4	bitr3i 186	1 |- ( th <-> ph )

Syntax hints:   <-> wb 105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  sbralie  2719  reu8  2931  unass  3290  ssin  3355  difab  3402  iunss  3923  poirr  4301  cnvuni  4806  dfco2  5120  dff1o6  5767  elznn0  9239  bj-ssom  14246