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

Theorem iuncom 3975
 Description: Commutation of indexed unions. (Contributed by NM, 18-Dec-2008.)
Assertion
Ref Expression
iuncom
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()   (,)

Proof of Theorem iuncom
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 rexcom 2772 . . . 4
2 eliun 3973 . . . . 5
32rexbii 2639 . . . 4
4 eliun 3973 . . . . 5
54rexbii 2639 . . . 4
61, 3, 53bitr4i 268 . . 3
7 eliun 3973 . . 3
8 eliun 3973 . . 3
96, 7, 83bitr4i 268 . 2
109eqriv 2350 1
 Colors of variables: wff setvar class Syntax hints:   wceq 1642   wcel 1710  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-v 2861  df-iun 3971 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator