MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexin Structured version   Visualization version   GIF version

Theorem rexin 4250
Description: Restricted existential quantification over intersection. (Contributed by Peter Mazsa, 17-Dec-2018.)
Assertion
Ref Expression
rexin (∃𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃𝑥𝐴 (𝑥𝐵𝜑))

Proof of Theorem rexin
StepHypRef Expression
1 elin 3967 . . . 4 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
21anbi1i 624 . . 3 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑))
3 anass 468 . . 3 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ (𝑥𝐴 ∧ (𝑥𝐵𝜑)))
42, 3bitri 275 . 2 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ (𝑥𝐴 ∧ (𝑥𝐵𝜑)))
54rexbii2 3090 1 (∃𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃𝑥𝐴 (𝑥𝐵𝜑))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2108  wrex 3070  cin 3950
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rex 3071  df-v 3482  df-in 3958
This theorem is referenced by:  wefrc  5679  elidinxp  6062  imaindm  6319  bnd2  9933  subislly  23489  pcmplfin  33859  sswfaxreg  45004
  Copyright terms: Public domain W3C validator