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

Theorem intexrab 5294
Description: The intersection of a nonempty restricted class abstraction exists. (Contributed by NM, 21-Oct-2003.)
Assertion
Ref Expression
intexrab (∃𝑥𝐴 𝜑 {𝑥𝐴𝜑} ∈ V)

Proof of Theorem intexrab
StepHypRef Expression
1 intexab 5293 . 2 (∃𝑥(𝑥𝐴𝜑) ↔ {𝑥 ∣ (𝑥𝐴𝜑)} ∈ V)
2 df-rex 3063 . 2 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
3 df-rab 3402 . . . 4 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
43inteqi 4908 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
54eleq1i 2828 . 2 ( {𝑥𝐴𝜑} ∈ V ↔ {𝑥 ∣ (𝑥𝐴𝜑)} ∈ V)
61, 2, 53bitr4i 303 1 (∃𝑥𝐴 𝜑 {𝑥𝐴𝜑} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wex 1781  wcel 2114  {cab 2715  wrex 3062  {crab 3401  Vcvv 3442   cint 4904
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-in 3910  df-ss 3920  df-nul 4288  df-int 4905
This theorem is referenced by:  onintrab2  7752  rankf  9718  rankvalb  9721  cardf2  9867  tskmval  10762  rgspnval  20557  lspval  20938  aspval  21840  clsval  22993  spanval  31420  fldgenval  33405
  Copyright terms: Public domain W3C validator