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

Theorem nfiun 4966
Description: Bound-variable hypothesis builder for indexed union. (Contributed by Mario Carneiro, 25-Jan-2014.) Add disjoint variable condition to avoid ax-13 2377. See nfiung 4968 for a less restrictive version requiring more axioms. (Revised by GG, 20-Jan-2024.)
Hypotheses
Ref Expression
nfiun.1 𝑦𝐴
nfiun.2 𝑦𝐵
Assertion
Ref Expression
nfiun 𝑦 𝑥𝐴 𝐵
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)

Proof of Theorem nfiun
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-iun 4936 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
2 nfiun.1 . . . 4 𝑦𝐴
3 nfiun.2 . . . . 5 𝑦𝐵
43nfcri 2891 . . . 4 𝑦 𝑧𝐵
52, 4nfrexw 3286 . . 3 𝑦𝑥𝐴 𝑧𝐵
65nfab 2905 . 2 𝑦{𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
71, 6nfcxfr 2897 1 𝑦 𝑥𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wcel 2114  {cab 2715  wnfc 2884  wrex 3062   ciun 4934
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-iun 4936
This theorem is referenced by:  iunab  4995  disjxiun  5083  ttrclselem1  9641  ttrclselem2  9642  ovoliunnul  25488  iunxpssiun1  32657  iundisjf  32678  iundisj2f  32679  iundisjfi  32888  iundisj2fi  32889  suppgsumssiun  33152  bnj1498  35223  nfttc  36693  ss2iundf  44108  nfcoll  44705  fnlimcnv  46117  fnlimfvre  46124  fnlimabslt  46129  smfaddlem1  47213  smflimlem6  47226  smflim  47227  smfmullem4  47244  smflim2  47256  smflimsup  47278  smfliminf  47281  fsupdm  47292  finfdm  47296
  Copyright terms: Public domain W3C validator