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

Theorem iunss1 3980
 Description: Subclass theorem for indexed union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iunss1
Distinct variable groups:   ,   ,
Allowed substitution hint:   ()

Proof of Theorem iunss1
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 ssrexv 3331 . . 3
2 eliun 3973 . . 3
3 eliun 3973 . . 3
41, 2, 33imtr4g 261 . 2
54ssrdv 3278 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wcel 1710  wrex 2615   wss 3257  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-nan 1288  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-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-ss 3259  df-iun 3971 This theorem is referenced by:  iuneq1  3982  iunxdif2  4014
 Copyright terms: Public domain W3C validator