Theorem bnj258 35106

Description: ∧-manipulation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Assertion

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

Proof of Theorem bnj258

Step	Hyp	Ref	Expression
1		bnj257 35105	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒 ∧ 𝜃) ↔ (𝜑 ∧ 𝜓 ∧ 𝜃 ∧ 𝜒))
2		df-bnj17 35085	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜃 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓 ∧ 𝜃) ∧ 𝜒))
3	1, 2	bitri 278	1 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒 ∧ 𝜃) ↔ ((𝜑 ∧ 𝜓 ∧ 𝜃) ∧ 𝜒))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   ∧ w-bnj17 35084

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 401  df-3an 1104  df-bnj17 35085

This theorem is used by:  bnj707  35153  bnj1019  35177  bnj556  35297  bnj594  35309  bnj1018g  35360  bnj1018  35361  bnj1110  35379