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

Theorem cbvoprab12 6729
Description: Rule used to change first two bound variables in an operation abstraction, using implicit substitution. (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Hypotheses
Ref Expression
cbvoprab12.1  |-  F/ w ph
cbvoprab12.2  |-  F/ v
ph
cbvoprab12.3  |-  F/ x ps
cbvoprab12.4  |-  F/ y ps
cbvoprab12.5  |-  ( ( x  =  w  /\  y  =  v )  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
cbvoprab12  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. w ,  v >. ,  z
>.  |  ps }
Distinct variable group:    x, y, z, w, v
Allowed substitution hints:    ph( x, y, z, w, v)    ps( x, y, z, w, v)

Proof of Theorem cbvoprab12
Dummy variable  u is distinct from all other variables.
StepHypRef Expression
1 nfv 1843 . . . . 5  |-  F/ w  u  =  <. x ,  y >.
2 cbvoprab12.1 . . . . 5  |-  F/ w ph
31, 2nfan 1828 . . . 4  |-  F/ w
( u  =  <. x ,  y >.  /\  ph )
4 nfv 1843 . . . . 5  |-  F/ v  u  =  <. x ,  y >.
5 cbvoprab12.2 . . . . 5  |-  F/ v
ph
64, 5nfan 1828 . . . 4  |-  F/ v ( u  =  <. x ,  y >.  /\  ph )
7 nfv 1843 . . . . 5  |-  F/ x  u  =  <. w ,  v >.
8 cbvoprab12.3 . . . . 5  |-  F/ x ps
97, 8nfan 1828 . . . 4  |-  F/ x
( u  =  <. w ,  v >.  /\  ps )
10 nfv 1843 . . . . 5  |-  F/ y  u  =  <. w ,  v >.
11 cbvoprab12.4 . . . . 5  |-  F/ y ps
1210, 11nfan 1828 . . . 4  |-  F/ y ( u  =  <. w ,  v >.  /\  ps )
13 opeq12 4404 . . . . . 6  |-  ( ( x  =  w  /\  y  =  v )  -> 
<. x ,  y >.  =  <. w ,  v
>. )
1413eqeq2d 2632 . . . . 5  |-  ( ( x  =  w  /\  y  =  v )  ->  ( u  =  <. x ,  y >.  <->  u  =  <. w ,  v >.
) )
15 cbvoprab12.5 . . . . 5  |-  ( ( x  =  w  /\  y  =  v )  ->  ( ph  <->  ps )
)
1614, 15anbi12d 747 . . . 4  |-  ( ( x  =  w  /\  y  =  v )  ->  ( ( u  = 
<. x ,  y >.  /\  ph )  <->  ( u  =  <. w ,  v
>.  /\  ps ) ) )
173, 6, 9, 12, 16cbvex2 2280 . . 3  |-  ( E. x E. y ( u  =  <. x ,  y >.  /\  ph ) 
<->  E. w E. v
( u  =  <. w ,  v >.  /\  ps ) )
1817opabbii 4717 . 2  |-  { <. u ,  z >.  |  E. x E. y ( u  =  <. x ,  y
>.  /\  ph ) }  =  { <. u ,  z >.  |  E. w E. v ( u  =  <. w ,  v
>.  /\  ps ) }
19 dfoprab2 6701 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. u ,  z >.  |  E. x E. y ( u  =  <. x ,  y
>.  /\  ph ) }
20 dfoprab2 6701 . 2  |-  { <. <.
w ,  v >. ,  z >.  |  ps }  =  { <. u ,  z >.  |  E. w E. v ( u  =  <. w ,  v
>.  /\  ps ) }
2118, 19, 203eqtr4i 2654 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. w ,  v >. ,  z
>.  |  ps }
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483   E.wex 1704   F/wnf 1708   <.cop 4183   {copab 4712   {coprab 6651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-opab 4713  df-oprab 6654
This theorem is referenced by:  cbvoprab12v  6730  cbvmpt2x  6733  dfoprab4f  7226  fmpt2x  7236  tposoprab  7388  cbvmpt2x2  42114
  Copyright terms: Public domain W3C validator