Theorem 3bitrri 205

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 183	. 2 |- ( ch <-> ph )
5	1, 4	bitr3i 184	1 |- ( th <-> ph )

Syntax hints:   <-> wb 103

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

This theorem depends on definitions:  df-bi 115

This theorem is referenced by:  reu8  2811  unass  3157  ssin  3222  difab  3268  iunss  3771  poirr  4134  cnvuni  4622  dfco2  4930  dff1o6  5555  elznn0  8765  bj-ssom  11831