Theorem 3bitr3rd 219

Description: Deduction from transitivity of biconditional. (Contributed by NM, 4-Aug-2006.)

Hypotheses

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

Assertion

Ref	Expression
3bitr3rd	|- ( ph -> ( ta <-> th ) )

Proof of Theorem 3bitr3rd

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

This proof depends on syntax axioms:   -> wi 4   <-> wb 105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This proof depends on definitions:  df-bi 117

This theorem is used by:  funconstss  5830  eqneg  9071  minclpr  12028  ballotfilemrv  13322  evenennn  13343  nmzsubg  14073  znidomb  15103  rpcxple2  16165  rpcxplt2  16166  wilthlem1  16244  lgslem1  16336