Theorem 3bitr3ri 200

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

Hypotheses

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

Assertion

Ref	Expression
3bitr3ri	|- ( th <-> ch )

Proof of Theorem 3bitr3ri

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

Syntax hints:   <-> wb 98

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  bigolden  862  sb9  1855  sbcco  2785  dfiin2g  3690  dffun6f  4915