MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbviun Unicode version

Theorem cbviun 3939
Description: Rule used to change the bound variables in an indexed union, with the substitution specified implicitly by the hypothesis. (Contributed by NM, 26-Mar-2006.) (Revised by Andrew Salmon, 25-Jul-2011.)
Hypotheses
Ref Expression
cbviun.1  |-  F/_ y B
cbviun.2  |-  F/_ x C
cbviun.3  |-  ( x  =  y  ->  B  =  C )
Assertion
Ref Expression
cbviun  |-  U_ x  e.  A  B  =  U_ y  e.  A  C
Distinct variable groups:    y, A    x, A
Allowed substitution hints:    B( x, y)    C( x, y)

Proof of Theorem cbviun
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 cbviun.1 . . . . 5  |-  F/_ y B
21nfcri 2413 . . . 4  |-  F/ y  z  e.  B
3 cbviun.2 . . . . 5  |-  F/_ x C
43nfcri 2413 . . . 4  |-  F/ x  z  e.  C
5 cbviun.3 . . . . 5  |-  ( x  =  y  ->  B  =  C )
65eleq2d 2350 . . . 4  |-  ( x  =  y  ->  (
z  e.  B  <->  z  e.  C ) )
72, 4, 6cbvrex 2761 . . 3  |-  ( E. x  e.  A  z  e.  B  <->  E. y  e.  A  z  e.  C )
87abbii 2395 . 2  |-  { z  |  E. x  e.  A  z  e.  B }  =  { z  |  E. y  e.  A  z  e.  C }
9 df-iun 3907 . 2  |-  U_ x  e.  A  B  =  { z  |  E. x  e.  A  z  e.  B }
10 df-iun 3907 . 2  |-  U_ y  e.  A  C  =  { z  |  E. y  e.  A  z  e.  C }
118, 9, 103eqtr4i 2313 1  |-  U_ x  e.  A  B  =  U_ y  e.  A  C
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1623    e. wcel 1684   {cab 2269   F/_wnfc 2406   E.wrex 2544   U_ciun 3905
This theorem is referenced by:  cbviunv  3941  disjxiun  4020  funiunfvf  5775  mpt2mptsx  6187  dmmpt2ssx  6189  fmpt2x  6190  ovmptss  6200  iunfi  7144  fsum2dlem  12233  fsumcom2  12237  fsumiun  12279  gsumcom2  15226  fiuncmp  17131  ovolfiniun  18860  ovoliunlem3  18863  ovoliun  18864  finiunmbl  18901  volfiniun  18904  iunmbl  18910  limciun  19244  hashunif  23385
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ral 2548  df-rex 2549  df-iun 3907
  Copyright terms: Public domain W3C validator