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

Theorem abrexex2g 7668
Description: Existence of an existentially restricted class abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
abrexex2g ((𝐴𝑉 ∧ ∀𝑥𝐴 {𝑦𝜑} ∈ 𝑊) → {𝑦 ∣ ∃𝑥𝐴 𝜑} ∈ V)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑉,𝑦   𝑥,𝑊,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem abrexex2g
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1914 . . . 4 𝑧𝑥𝐴 𝜑
2 nfcv 2980 . . . . 5 𝑦𝐴
3 nfs1v 2159 . . . . 5 𝑦[𝑧 / 𝑦]𝜑
42, 3nfrex 3312 . . . 4 𝑦𝑥𝐴 [𝑧 / 𝑦]𝜑
5 sbequ12 2252 . . . . 5 (𝑦 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑦]𝜑))
65rexbidv 3300 . . . 4 (𝑦 = 𝑧 → (∃𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 [𝑧 / 𝑦]𝜑))
71, 4, 6cbvabw 2893 . . 3 {𝑦 ∣ ∃𝑥𝐴 𝜑} = {𝑧 ∣ ∃𝑥𝐴 [𝑧 / 𝑦]𝜑}
8 df-clab 2803 . . . . 5 (𝑧 ∈ {𝑦𝜑} ↔ [𝑧 / 𝑦]𝜑)
98rexbii 3250 . . . 4 (∃𝑥𝐴 𝑧 ∈ {𝑦𝜑} ↔ ∃𝑥𝐴 [𝑧 / 𝑦]𝜑)
109abbii 2889 . . 3 {𝑧 ∣ ∃𝑥𝐴 𝑧 ∈ {𝑦𝜑}} = {𝑧 ∣ ∃𝑥𝐴 [𝑧 / 𝑦]𝜑}
117, 10eqtr4i 2850 . 2 {𝑦 ∣ ∃𝑥𝐴 𝜑} = {𝑧 ∣ ∃𝑥𝐴 𝑧 ∈ {𝑦𝜑}}
12 df-iun 4924 . . 3 𝑥𝐴 {𝑦𝜑} = {𝑧 ∣ ∃𝑥𝐴 𝑧 ∈ {𝑦𝜑}}
13 iunexg 7667 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 {𝑦𝜑} ∈ 𝑊) → 𝑥𝐴 {𝑦𝜑} ∈ V)
1412, 13eqeltrrid 2921 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 {𝑦𝜑} ∈ 𝑊) → {𝑧 ∣ ∃𝑥𝐴 𝑧 ∈ {𝑦𝜑}} ∈ V)
1511, 14eqeltrid 2920 1 ((𝐴𝑉 ∧ ∀𝑥𝐴 {𝑦𝜑} ∈ 𝑊) → {𝑦 ∣ ∃𝑥𝐴 𝜑} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  [wsb 2068  wcel 2113  {cab 2802  wral 3141  wrex 3142  Vcvv 3497   ciun 4922
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:  abrexex2  7673  ptrescn  22250  satfvsuclem1  32610  satf0suclem  32626  fmlasuc0  32635  sdclem2  35021  sdclem1  35022  sprval  43648  prprval  43683
  Copyright terms: Public domain W3C validator