Theorem r19.41v

Description: Restricted quantifier version 19.41v . Version of r19.41 with a disjoint variable condition, requiring fewer axioms. (Contributed by NM, 17-Dec-2003) Reduce dependencies on axioms. (Revised by BJ, 29-Mar-2020)

	Ref	Expression
Assertion	r19.41v	⊢ ( ∃ 𝑥 ∈ 𝐴 ( 𝜑 ∧ 𝜓 ) ↔ ( ∃ 𝑥 ∈ 𝐴 𝜑 ∧ 𝜓 ) )

Proof

Step	Hyp	Ref	Expression
1		anass	⊢ ( ( ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) ↔ ( 𝑥 ∈ 𝐴 ∧ ( 𝜑 ∧ 𝜓 ) ) )
2	1	exbii	⊢ ( ∃ 𝑥 ( ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) ↔ ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ ( 𝜑 ∧ 𝜓 ) ) )
3		19.41v	⊢ ( ∃ 𝑥 ( ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) ↔ ( ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) )
4	2 3	bitr3i	⊢ ( ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ ( 𝜑 ∧ 𝜓 ) ) ↔ ( ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) )
5		df-rex	⊢ ( ∃ 𝑥 ∈ 𝐴 ( 𝜑 ∧ 𝜓 ) ↔ ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ ( 𝜑 ∧ 𝜓 ) ) )
6		df-rex	⊢ ( ∃ 𝑥 ∈ 𝐴 𝜑 ↔ ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) )
7	6	anbi1i	⊢ ( ( ∃ 𝑥 ∈ 𝐴 𝜑 ∧ 𝜓 ) ↔ ( ∃ 𝑥 ( 𝑥 ∈ 𝐴 ∧ 𝜑 ) ∧ 𝜓 ) )
8	4 5 7	3bitr4i	⊢ ( ∃ 𝑥 ∈ 𝐴 ( 𝜑 ∧ 𝜓 ) ↔ ( ∃ 𝑥 ∈ 𝐴 𝜑 ∧ 𝜓 ) )