Theorem selconj 38809

Description: An inference for selecting one of a list of conjuncts. (Contributed by Giovanni Mascellani, 23-May-2019.)

Hypothesis

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

Assertion

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

Proof of Theorem selconj

Step	Hyp	Ref	Expression
1		selconj.1	. . 3 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))
2	1	anbi2i 635	. 2 ⊢ ((𝜂 ∧ 𝜑) ↔ (𝜂 ∧ (𝜓 ∧ 𝜒)))
3		an12 658	. 2 ⊢ ((𝜓 ∧ (𝜂 ∧ 𝜒)) ↔ (𝜂 ∧ (𝜓 ∧ 𝜒)))
4	2, 3	bitr4i 281	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: (None)