Theorem anbi2ci 677

Description: Variant of anbi2i 675 with commutation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Hypothesis

Ref	Expression
bi.aa	|- (ph <-> ps)

Assertion

Ref	Expression
anbi2ci	|- ((ph /\ ch) <-> (ch /\ ps))

Proof of Theorem anbi2ci

Step	Hyp	Ref	Expression
1		bi.aa	. . 3 |- (ph <-> ps)
2	1	anbi1i 676	. 2 |- ((ph /\ ch) <-> (ps /\ ch))
3		ancom 437	. 2 |- ((ps /\ ch) <-> (ch /\ ps))
4	2, 3	bitri 240	1 |- ((ph /\ ch) <-> (ch /\ ps))

Syntax hints:   <-> wb 176   /\ wa 358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 177  df-an 360

This theorem is referenced by:  clabel  2475  enmap2lem1  6064  enmap1lem1  6070  lecex  6116