New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  nfiun Unicode version

Theorem nfiun 3995
 Description: Bound-variable hypothesis builder for indexed union. (Contributed by Mario Carneiro, 25-Jan-2014.)
Hypotheses
Ref Expression
nfiun.1
nfiun.2
Assertion
Ref Expression
nfiun

Proof of Theorem nfiun
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 df-iun 3971 . 2
2 nfiun.1 . . . 4
3 nfiun.2 . . . . 5
43nfcri 2483 . . . 4
52, 4nfrex 2669 . . 3
65nfab 2493 . 2
71, 6nfcxfr 2486 1
 Colors of variables: wff setvar class Syntax hints:   wcel 1710  cab 2339  wnfc 2476  wrex 2615  ciun 3969 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-rex 2620  df-iun 3971 This theorem is referenced by:  iunab  4012
 Copyright terms: Public domain W3C validator