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

Theorem iunrab 4503
 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 4502 . 2 𝑥𝐴 {𝑦 ∣ (𝑦𝐵𝜑)} = {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)}
2 df-rab 2905 . . . 4 {𝑦𝐵𝜑} = {𝑦 ∣ (𝑦𝐵𝜑)}
32a1i 11 . . 3 (𝑥𝐴 → {𝑦𝐵𝜑} = {𝑦 ∣ (𝑦𝐵𝜑)})
43iuneq2i 4475 . 2 𝑥𝐴 {𝑦𝐵𝜑} = 𝑥𝐴 {𝑦 ∣ (𝑦𝐵𝜑)}
5 df-rab 2905 . . 3 {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑)}
6 r19.42v 3073 . . . 4 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
76abbii 2726 . . 3 {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑)}
85, 7eqtr4i 2635 . 2 {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑} = {𝑦 ∣ ∃𝑥𝐴 (𝑦𝐵𝜑)}
91, 4, 83eqtr4i 2642 1 𝑥𝐴 {𝑦𝐵𝜑} = {𝑦𝐵 ∣ ∃𝑥𝐴 𝜑}
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  ∃wrex 2897  {crab 2900  ∪ ciun 4455 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-in 3547  df-ss 3554  df-iun 4457 This theorem is referenced by:  incexc2  14409  phisum  15333  itg2monolem1  23323  aannenlem1  23887  musum  24717  lgsquadlem1  24905  lgsquadlem2  24906  iunpreima  28765  poimirlem27  32606  cnambfre  32628  mapdval3N  35938  mapdval5N  35940  fiphp3d  36401
 Copyright terms: Public domain W3C validator