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

Theorem iunrab 4599
 Description: The indexed union of a restricted class abstraction. (Contributed by NM, 3-Jan-2004.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
iunrab 𝑥𝐴 {𝑦𝐵𝜑} = {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑}
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem iunrab
StepHypRef Expression
1 iunab 4598 . 2 𝑥𝐴 {𝑦 ∣ (𝑦𝐵𝜑)} = {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)}
2 df-rab 2950 . . . 4 {𝑦𝐵𝜑} = {𝑦 ∣ (𝑦𝐵𝜑)}
32a1i 11 . . 3 (𝑥𝐴 → {𝑦𝐵𝜑} = {𝑦 ∣ (𝑦𝐵𝜑)})
43iuneq2i 4571 . 2 𝑥𝐴 {𝑦𝐵𝜑} = 𝑥𝐴 {𝑦 ∣ (𝑦𝐵𝜑)}
5 df-rab 2950 . . 3 {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑)}
6 r19.42v 3121 . . . 4 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
76abbii 2768 . . 3 {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑)}
85, 7eqtr4i 2676 . 2 {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑} = {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)}
91, 4, 83eqtr4i 2683 1 𝑥𝐴 {𝑦𝐵𝜑} = {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑}
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 383   = wceq 1523   ∈ wcel 2030  {cab 2637  ∃wrex 2942  {crab 2945  ∪ ciun 4552 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-in 3614  df-ss 3621  df-iun 4554 This theorem is referenced by:  hashrabrex  14601  incexc2  14614  phisum  15542  itg2monolem1  23562  aannenlem1  24128  musum  24962  lgsquadlem1  25150  lgsquadlem2  25151  edglnl  26083  iunpreima  29509  poimirlem27  33566  cnambfre  33588  mapdval3N  37237  mapdval5N  37239  fiphp3d  37700
 Copyright terms: Public domain W3C validator