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

Theorem nfun 4124
Description: Bound-variable hypothesis builder for the union of classes. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 14-Oct-2016.) Avoid ax-10 2147, ax-11 2163, ax-12 2185. (Revised by SN, 14-May-2025.)
Hypotheses
Ref Expression
nfun.1 𝑥𝐴
nfun.2 𝑥𝐵
Assertion
Ref Expression
nfun 𝑥(𝐴𝐵)

Proof of Theorem nfun
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elun 4107 . . 3 (𝑦 ∈ (𝐴𝐵) ↔ (𝑦𝐴𝑦𝐵))
2 nfun.1 . . . . 5 𝑥𝐴
32nfcri 2891 . . . 4 𝑥 𝑦𝐴
4 nfun.2 . . . . 5 𝑥𝐵
54nfcri 2891 . . . 4 𝑥 𝑦𝐵
63, 5nfor 1906 . . 3 𝑥(𝑦𝐴𝑦𝐵)
71, 6nfxfr 1855 . 2 𝑥 𝑦 ∈ (𝐴𝐵)
87nfci 2887 1 𝑥(𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wo 848  wcel 2114  wnfc 2884  cun 3901
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-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-v 3444  df-un 3908
This theorem is referenced by:  nfsymdif  4211  csbun  4395  iunxdif3  5052  nfsuc  6399  nfsup  9366  nfdju  9831  iunconn  23384  nosupbnd2  27696  noinfbnd2  27711  ordtconnlem1  34102  esumsplit  34231  measvuni  34392  bnj958  35116  bnj1000  35117  bnj1408  35212  bnj1446  35221  bnj1447  35222  bnj1448  35223  bnj1466  35229  bnj1467  35230  rdgssun  37633  exrecfnlem  37634  poimirlem16  37887  poimirlem19  37890  pimxrneun  45846  pimrecltpos  47066
  Copyright terms: Public domain W3C validator