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

Theorem cbvopab 4007
Description: Rule used to change bound variables in an ordered-pair class abstraction, using implicit substitution. (Contributed by NM, 14-Sep-2003.)
Hypotheses
Ref Expression
cbvopab.1  |-  F/ z
ph
cbvopab.2  |-  F/ w ph
cbvopab.3  |-  F/ x ps
cbvopab.4  |-  F/ y ps
cbvopab.5  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
cbvopab  |-  { <. x ,  y >.  |  ph }  =  { <. z ,  w >.  |  ps }
Distinct variable group:    x, y, z, w
Allowed substitution hints:    ph( x, y, z, w)    ps( x, y, z, w)

Proof of Theorem cbvopab
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 nfv 1509 . . . . 5  |-  F/ z  v  =  <. x ,  y >.
2 cbvopab.1 . . . . 5  |-  F/ z
ph
31, 2nfan 1545 . . . 4  |-  F/ z ( v  =  <. x ,  y >.  /\  ph )
4 nfv 1509 . . . . 5  |-  F/ w  v  =  <. x ,  y >.
5 cbvopab.2 . . . . 5  |-  F/ w ph
64, 5nfan 1545 . . . 4  |-  F/ w
( v  =  <. x ,  y >.  /\  ph )
7 nfv 1509 . . . . 5  |-  F/ x  v  =  <. z ,  w >.
8 cbvopab.3 . . . . 5  |-  F/ x ps
97, 8nfan 1545 . . . 4  |-  F/ x
( v  =  <. z ,  w >.  /\  ps )
10 nfv 1509 . . . . 5  |-  F/ y  v  =  <. z ,  w >.
11 cbvopab.4 . . . . 5  |-  F/ y ps
1210, 11nfan 1545 . . . 4  |-  F/ y ( v  =  <. z ,  w >.  /\  ps )
13 opeq12 3715 . . . . . 6  |-  ( ( x  =  z  /\  y  =  w )  -> 
<. x ,  y >.  =  <. z ,  w >. )
1413eqeq2d 2152 . . . . 5  |-  ( ( x  =  z  /\  y  =  w )  ->  ( v  =  <. x ,  y >.  <->  v  =  <. z ,  w >. ) )
15 cbvopab.5 . . . . 5  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
1614, 15anbi12d 465 . . . 4  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ( v  = 
<. x ,  y >.  /\  ph )  <->  ( v  =  <. z ,  w >.  /\  ps ) ) )
173, 6, 9, 12, 16cbvex2 1895 . . 3  |-  ( E. x E. y ( v  =  <. x ,  y >.  /\  ph ) 
<->  E. z E. w
( v  =  <. z ,  w >.  /\  ps ) )
1817abbii 2256 . 2  |-  { v  |  E. x E. y ( v  = 
<. x ,  y >.  /\  ph ) }  =  { v  |  E. z E. w ( v  =  <. z ,  w >.  /\  ps ) }
19 df-opab 3998 . 2  |-  { <. x ,  y >.  |  ph }  =  { v  |  E. x E. y
( v  =  <. x ,  y >.  /\  ph ) }
20 df-opab 3998 . 2  |-  { <. z ,  w >.  |  ps }  =  { v  |  E. z E. w
( v  =  <. z ,  w >.  /\  ps ) }
2118, 19, 203eqtr4i 2171 1  |-  { <. x ,  y >.  |  ph }  =  { <. z ,  w >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332   F/wnf 1437   E.wex 1469   {cab 2126   <.cop 3535   {copab 3996
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-sn 3538  df-pr 3539  df-op 3541  df-opab 3998
This theorem is referenced by:  cbvopabv  4008  opelopabsb  4190
  Copyright terms: Public domain W3C validator