Theorem bianass 641

Description: An inference to merge two lists of conjuncts. (Contributed by Giovanni Mascellani, 23-May-2019.)

Hypothesis

Ref	Expression
bianass.1	⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))

Assertion

Ref	Expression
bianass	⊢ ((𝜂 ∧ 𝜑) ↔ ((𝜂 ∧ 𝜓) ∧ 𝜒))

Proof of Theorem bianass

Step	Hyp	Ref	Expression
1		bianass.1	. . 3 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))
2	1	anbi2i 622	. 2 ⊢ ((𝜂 ∧ 𝜑) ↔ (𝜂 ∧ (𝜓 ∧ 𝜒)))
3		anass 468	. 2 ⊢ (((𝜂 ∧ 𝜓) ∧ 𝜒) ↔ (𝜂 ∧ (𝜓 ∧ 𝜒)))
4	2, 3	bitr4i 278	1 ⊢ ((𝜂 ∧ 𝜑) ↔ ((𝜂 ∧ 𝜓) ∧ 𝜒))

Syntax hints:   ↔ wb 206   ∧ wa 395

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 207  df-an 396

This theorem is referenced by:  bianassc  642  an12  644  an4  655  cnvresima  6261  elcncf1di  24940  nb3grpr2  29418  wwlksnextwrd  29930  cusgr3cyclex  35104  satfvsuclem2  35328  bj-prmoore  37081  bj-imdirco  37156  redundpim3  38586  isthincd2  48705