Theorem rexin 4211

Description: Restricted existential quantification over intersection. (Contributed by Peter Mazsa, 17-Dec-2018.)

Assertion

Ref	Expression
rexin	⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝜑))

Proof of Theorem rexin

Step	Hyp	Ref	Expression
1		elin 3929	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
2	1	anbi1i 635	. . 3 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑))
3		anass 473	. . 3 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ 𝜑)))
4	2, 3	bitri 278	. 2 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ 𝜑)))
5	4	rexbii2 3114	1 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝜑))

Syntax hints:   ↔ wb 209   ∧ wa 400   ∈ wcel 2149  ∃wrex 3095   ∩ cin 3912

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rex 3096  df-v 3465  df-in 3920

This theorem is referenced by:  wefrc  5653  elidinxp  6044  imaindm  6297  bnd2  9875  subislly  23603  pcmplfin  34191  sswfaxreg  45581