ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iuncom Unicode version

Theorem iuncom 3663
Description: Commutation of indexed unions. (Contributed by NM, 18-Dec-2008.)
Assertion
Ref Expression
iuncom  |-  U_ x  e.  A  U_ y  e.  B  C  =  U_ y  e.  B  U_ x  e.  A  C
Distinct variable groups:    y, A    x, B    x, y
Allowed substitution hints:    A( x)    B( y)    C( x, y)

Proof of Theorem iuncom
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 rexcom 2474 . . . 4  |-  ( E. x  e.  A  E. y  e.  B  z  e.  C  <->  E. y  e.  B  E. x  e.  A  z  e.  C )
2 eliun 3661 . . . . 5  |-  ( z  e.  U_ y  e.  B  C  <->  E. y  e.  B  z  e.  C )
32rexbii 2331 . . . 4  |-  ( E. x  e.  A  z  e.  U_ y  e.  B  C  <->  E. x  e.  A  E. y  e.  B  z  e.  C )
4 eliun 3661 . . . . 5  |-  ( z  e.  U_ x  e.  A  C  <->  E. x  e.  A  z  e.  C )
54rexbii 2331 . . . 4  |-  ( E. y  e.  B  z  e.  U_ x  e.  A  C  <->  E. y  e.  B  E. x  e.  A  z  e.  C )
61, 3, 53bitr4i 201 . . 3  |-  ( E. x  e.  A  z  e.  U_ y  e.  B  C  <->  E. y  e.  B  z  e.  U_ x  e.  A  C
)
7 eliun 3661 . . 3  |-  ( z  e.  U_ x  e.  A  U_ y  e.  B  C  <->  E. x  e.  A  z  e.  U_ y  e.  B  C
)
8 eliun 3661 . . 3  |-  ( z  e.  U_ y  e.  B  U_ x  e.  A  C  <->  E. y  e.  B  z  e.  U_ x  e.  A  C
)
96, 7, 83bitr4i 201 . 2  |-  ( z  e.  U_ x  e.  A  U_ y  e.  B  C  <->  z  e.  U_ y  e.  B  U_ x  e.  A  C
)
109eqriv 2037 1  |-  U_ x  e.  A  U_ y  e.  B  C  =  U_ y  e.  B  U_ x  e.  A  C
Colors of variables: wff set class
Syntax hints:    = wceq 1243    e. wcel 1393   E.wrex 2307   U_ciun 3657
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-iun 3659
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator