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

Theorem csbunig 4015
Description: Distribute proper substitution through the union of a class. (Contributed by Alan Sare, 10-Nov-2012.)
Assertion
Ref Expression
csbunig  |-  ( A  e.  V  ->  [_ A  /  x ]_ U. B  =  U. [_ A  /  x ]_ B )

Proof of Theorem csbunig
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 csbabg 3302 . . 3  |-  ( A  e.  V  ->  [_ A  /  x ]_ { z  |  E. y ( z  e.  y  /\  y  e.  B ) }  =  { z  |  [. A  /  x ]. E. y ( z  e.  y  /\  y  e.  B ) } )
2 sbcexg 3203 . . . . 5  |-  ( A  e.  V  ->  ( [. A  /  x ]. E. y ( z  e.  y  /\  y  e.  B )  <->  E. y [. A  /  x ]. ( z  e.  y  /\  y  e.  B
) ) )
3 sbcang 3196 . . . . . . 7  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( z  e.  y  /\  y  e.  B
)  <->  ( [. A  /  x ]. z  e.  y  /\  [. A  /  x ]. y  e.  B ) ) )
4 sbcg 3218 . . . . . . . 8  |-  ( A  e.  V  ->  ( [. A  /  x ]. z  e.  y  <->  z  e.  y ) )
5 sbcel2g 3264 . . . . . . . 8  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  B  <->  y  e.  [_ A  /  x ]_ B ) )
64, 5anbi12d 692 . . . . . . 7  |-  ( A  e.  V  ->  (
( [. A  /  x ]. z  e.  y  /\  [. A  /  x ]. y  e.  B
)  <->  ( z  e.  y  /\  y  e. 
[_ A  /  x ]_ B ) ) )
73, 6bitrd 245 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( z  e.  y  /\  y  e.  B
)  <->  ( z  e.  y  /\  y  e. 
[_ A  /  x ]_ B ) ) )
87exbidv 1636 . . . . 5  |-  ( A  e.  V  ->  ( E. y [. A  /  x ]. ( z  e.  y  /\  y  e.  B )  <->  E. y
( z  e.  y  /\  y  e.  [_ A  /  x ]_ B
) ) )
92, 8bitrd 245 . . . 4  |-  ( A  e.  V  ->  ( [. A  /  x ]. E. y ( z  e.  y  /\  y  e.  B )  <->  E. y
( z  e.  y  /\  y  e.  [_ A  /  x ]_ B
) ) )
109abbidv 2549 . . 3  |-  ( A  e.  V  ->  { z  |  [. A  /  x ]. E. y ( z  e.  y  /\  y  e.  B ) }  =  { z  |  E. y ( z  e.  y  /\  y  e.  [_ A  /  x ]_ B ) } )
111, 10eqtrd 2467 . 2  |-  ( A  e.  V  ->  [_ A  /  x ]_ { z  |  E. y ( z  e.  y  /\  y  e.  B ) }  =  { z  |  E. y ( z  e.  y  /\  y  e.  [_ A  /  x ]_ B ) } )
12 df-uni 4008 . . 3  |-  U. B  =  { z  |  E. y ( z  e.  y  /\  y  e.  B ) }
1312csbeq2i 3269 . 2  |-  [_ A  /  x ]_ U. B  =  [_ A  /  x ]_ { z  |  E. y ( z  e.  y  /\  y  e.  B ) }
14 df-uni 4008 . 2  |-  U. [_ A  /  x ]_ B  =  { z  |  E. y ( z  e.  y  /\  y  e. 
[_ A  /  x ]_ B ) }
1511, 13, 143eqtr4g 2492 1  |-  ( A  e.  V  ->  [_ A  /  x ]_ U. B  =  U. [_ A  /  x ]_ B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359   E.wex 1550    = wceq 1652    e. wcel 1725   {cab 2421   [.wsbc 3153   [_csb 3243   U.cuni 4007
This theorem is referenced by:  csbfv12gALT  5731  csbfv12gALTVD  28948
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-v 2950  df-sbc 3154  df-csb 3244  df-uni 4008
  Copyright terms: Public domain W3C validator