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

Theorem abrexexg 7665
Description: Existence of a class abstraction of existentially restricted sets. The class 𝐵 can be thought of as an expression in 𝑥 (which is typically a free variable in the class expression substituted for 𝐵) and the class abstraction appearing in the statement as the class of values 𝐵 as 𝑥 varies through 𝐴. If the "domain" 𝐴 is a set, then the abstraction is also a set. Therefore, this statement is a kind of Replacement. This can be seen by tracing back through the path mptexg 6987, funex 6985, fnex 6983, resfunexg 6981, and funimaexg 6443. See also abrexex2g 7668. There are partial converses under additional conditions, see for instance abnexg 7481. (Contributed by NM, 3-Nov-2003.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
abrexexg (𝐴𝑉 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem abrexexg
StepHypRef Expression
1 eqid 2824 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
21rnmpt 5830 . 2 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
3 mptexg 6987 . . 3 (𝐴𝑉 → (𝑥𝐴𝐵) ∈ V)
4 rnexg 7617 . . 3 ((𝑥𝐴𝐵) ∈ V → ran (𝑥𝐴𝐵) ∈ V)
53, 4syl 17 . 2 (𝐴𝑉 → ran (𝑥𝐴𝐵) ∈ V)
62, 5eqeltrrid 2921 1 (𝐴𝑉 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1536  wcel 2113  {cab 2802  wrex 3142  Vcvv 3497  cmpt 5149  ran crn 5559
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366
This theorem is referenced by:  abrexex  7666  iunexg  7667  qsexg  8358  wdomd  9048  cardiun  9414  rankcf  10202  sigaclci  31395  satf0suclem  32626  hbtlem1  39729  hbtlem7  39731  setpreimafvex  43550  fundcmpsurinj  43576  fundcmpsurbijinj  43577
  Copyright terms: Public domain W3C validator