Metamath Proof Explorer


Theorem 3bitr4ri

Description: A chained inference from transitive law for logical equivalence. (Contributed by NM, 2-Sep-1995)

Ref Expression
Hypotheses 3bitr4i.1
|- ( ph <-> ps )
3bitr4i.2
|- ( ch <-> ph )
3bitr4i.3
|- ( th <-> ps )
Assertion 3bitr4ri
|- ( th <-> ch )

Proof

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