Theorem 3bitr4rd 277

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

Hypotheses

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

Assertion

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

Proof of Theorem 3bitr4rd

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

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

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 177

This theorem is used by: (None)