Theorem an42 670

Description: Rearrangement of 4 conjuncts. (Contributed by NM, 7-Feb-1996.)

Assertion

Ref	Expression
an42	⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) ↔ ((𝜑 ∧ 𝜒) ∧ (𝜃 ∧ 𝜓)))

Proof of Theorem an42

Step	Hyp	Ref	Expression
1		an4 669	. 2 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) ↔ ((𝜑 ∧ 𝜒) ∧ (𝜓 ∧ 𝜃)))
2		ancom 466	. . 3 ⊢ ((𝜓 ∧ 𝜃) ↔ (𝜃 ∧ 𝜓))
3	2	anbi2i 635	. 2 ⊢ (((𝜑 ∧ 𝜒) ∧ (𝜓 ∧ 𝜃)) ↔ ((𝜑 ∧ 𝜒) ∧ (𝜃 ∧ 𝜓)))
4	1, 3	bitri 278	1 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) ↔ ((𝜑 ∧ 𝜒) ∧ (𝜃 ∧ 𝜓)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401

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

This proof depends on definitions:  df-bi 210  df-an 402

This theorem is used by:  an43  671  4anpull2  1382  an33rean  1514  brecop2  8832  supmo  9444  infmo  9489  aceq1  10196  dfiso2  17947  eulerpartlemt0  35001  isbasisrelowllem1  38278  isbasisrelowllem2  38279  ifp1bi  44502