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

Theorem cbvixp 7016
Description: Change bound variable in an indexed Cartesian product. (Contributed by Jeff Madsen, 20-Jun-2011.)
Hypotheses
Ref Expression
cbvixp.1  |-  F/_ y B
cbvixp.2  |-  F/_ x C
cbvixp.3  |-  ( x  =  y  ->  B  =  C )
Assertion
Ref Expression
cbvixp  |-  X_ x  e.  A  B  =  X_ y  e.  A  C
Distinct variable group:    x, y, A
Allowed substitution hints:    B( x, y)    C( x, y)

Proof of Theorem cbvixp
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 cbvixp.1 . . . . . 6  |-  F/_ y B
21nfel2 2536 . . . . 5  |-  F/ y ( f `  x
)  e.  B
3 cbvixp.2 . . . . . 6  |-  F/_ x C
43nfel2 2536 . . . . 5  |-  F/ x
( f `  y
)  e.  C
5 fveq2 5669 . . . . . 6  |-  ( x  =  y  ->  (
f `  x )  =  ( f `  y ) )
6 cbvixp.3 . . . . . 6  |-  ( x  =  y  ->  B  =  C )
75, 6eleq12d 2456 . . . . 5  |-  ( x  =  y  ->  (
( f `  x
)  e.  B  <->  ( f `  y )  e.  C
) )
82, 4, 7cbvral 2872 . . . 4  |-  ( A. x  e.  A  (
f `  x )  e.  B  <->  A. y  e.  A  ( f `  y
)  e.  C )
98anbi2i 676 . . 3  |-  ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B )  <->  ( f  Fn  A  /\  A. y  e.  A  ( f `  y )  e.  C
) )
109abbii 2500 . 2  |-  { f  |  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B
) }  =  {
f  |  ( f  Fn  A  /\  A. y  e.  A  (
f `  y )  e.  C ) }
11 dfixp 7002 . 2  |-  X_ x  e.  A  B  =  { f  |  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B ) }
12 dfixp 7002 . 2  |-  X_ y  e.  A  C  =  { f  |  ( f  Fn  A  /\  A. y  e.  A  ( f `  y )  e.  C ) }
1310, 11, 123eqtr4i 2418 1  |-  X_ x  e.  A  B  =  X_ y  e.  A  C
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1717   {cab 2374   F/_wnfc 2511   A.wral 2650    Fn wfn 5390   ` cfv 5395   X_cixp 7000
This theorem is referenced by:  cbvixpv  7017  mptelixpg  7036  ixpiunwdom  7493  prdsbas3  13631  elptr2  17528  ptunimpt  17549  ptcldmpt  17568
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2369
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2375  df-cleq 2381  df-clel 2384  df-nfc 2513  df-ral 2655  df-rex 2656  df-rab 2659  df-v 2902  df-dif 3267  df-un 3269  df-in 3271  df-ss 3278  df-nul 3573  df-if 3684  df-sn 3764  df-pr 3765  df-op 3767  df-uni 3959  df-br 4155  df-iota 5359  df-fn 5398  df-fv 5403  df-ixp 7001
  Copyright terms: Public domain W3C validator