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

Theorem abrexexgOLD 8002
Description: Obsolete version of abrexexg 8001 as of 11-Dec-2024. EDITORIAL: Comment kept since the line of equivalences to ax-rep 5303 is different.

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 7258, funex 7256, fnex 7254, resfunexg 7252, and funimaexg 6664. See also abrexex2g 8005. There are partial converses under additional conditions, see for instance abnexg 7791. (Contributed by NM, 3-Nov-2003.) (Proof shortened by Mario Carneiro, 31-Aug-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion
Ref Expression
abrexexgOLD (𝐴𝑉 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem abrexexgOLD
StepHypRef Expression
1 eqid 2740 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
21rnmpt 5980 . 2 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
3 mptexg 7258 . . 3 (𝐴𝑉 → (𝑥𝐴𝐵) ∈ V)
4 rnexg 7942 . . 3 ((𝑥𝐴𝐵) ∈ V → ran (𝑥𝐴𝐵) ∈ V)
53, 4syl 17 . 2 (𝐴𝑉 → ran (𝑥𝐴𝐵) ∈ V)
62, 5eqeltrrid 2849 1 (𝐴𝑉 → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  {cab 2717  wrex 3076  Vcvv 3488  cmpt 5249  ran crn 5701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator