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

Theorem cbvoprab12 5951
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 1528 . . . . 5  |-  F/ w  u  =  <. x ,  y >.
2 cbvoprab12.1 . . . . 5  |-  F/ w ph
31, 2nfan 1565 . . . 4  |-  F/ w
( u  =  <. x ,  y >.  /\  ph )
4 nfv 1528 . . . . 5  |-  F/ v  u  =  <. x ,  y >.
5 cbvoprab12.2 . . . . 5  |-  F/ v
ph
64, 5nfan 1565 . . . 4  |-  F/ v ( u  =  <. x ,  y >.  /\  ph )
7 nfv 1528 . . . . 5  |-  F/ x  u  =  <. w ,  v >.
8 cbvoprab12.3 . . . . 5  |-  F/ x ps
97, 8nfan 1565 . . . 4  |-  F/ x
( u  =  <. w ,  v >.  /\  ps )
10 nfv 1528 . . . . 5  |-  F/ y  u  =  <. w ,  v >.
11 cbvoprab12.4 . . . . 5  |-  F/ y ps
1210, 11nfan 1565 . . . 4  |-  F/ y ( u  =  <. w ,  v >.  /\  ps )
13 opeq12 3782 . . . . . 6  |-  ( ( x  =  w  /\  y  =  v )  -> 
<. x ,  y >.  =  <. w ,  v
>. )
1413eqeq2d 2189 . . . . 5  |-  ( ( x  =  w  /\  y  =  v )  ->  ( u  =  <. x ,  y >.  <->  u  =  <. w ,  v >.
) )
15 cbvoprab12.5 . . . . 5  |-  ( ( x  =  w  /\  y  =  v )  ->  ( ph  <->  ps )
)
1614, 15anbi12d 473 . . . 4  |-  ( ( x  =  w  /\  y  =  v )  ->  ( ( u  = 
<. x ,  y >.  /\  ph )  <->  ( u  =  <. w ,  v
>.  /\  ps ) ) )
173, 6, 9, 12, 16cbvex2 1922 . . 3  |-  ( E. x E. y ( u  =  <. x ,  y >.  /\  ph ) 
<->  E. w E. v
( u  =  <. w ,  v >.  /\  ps ) )
1817opabbii 4072 . 2  |-  { <. u ,  z >.  |  E. x E. y ( u  =  <. x ,  y
>.  /\  ph ) }  =  { <. u ,  z >.  |  E. w E. v ( u  =  <. w ,  v
>.  /\  ps ) }
19 dfoprab2 5924 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. u ,  z >.  |  E. x E. y ( u  =  <. x ,  y
>.  /\  ph ) }
20 dfoprab2 5924 . 2  |-  { <. <.
w ,  v >. ,  z >.  |  ps }  =  { <. u ,  z >.  |  E. w E. v ( u  =  <. w ,  v
>.  /\  ps ) }
2118, 19, 203eqtr4i 2208 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. w ,  v >. ,  z
>.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   F/wnf 1460   E.wex 1492   <.cop 3597   {copab 4065   {coprab 5878
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-opab 4067  df-oprab 5881
This theorem is referenced by:  cbvoprab12v  5952  cbvmpox  5955  dfoprab4f  6196  fmpox  6203  tposoprab  6283
  Copyright terms: Public domain W3C validator