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

Theorem cbvoprab3 5840
Description: Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 22-Aug-2013.)
Hypotheses
Ref Expression
cbvoprab3.1  |-  F/ w ph
cbvoprab3.2  |-  F/ z ps
cbvoprab3.3  |-  ( z  =  w  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvoprab3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  w >.  |  ps }
Distinct variable groups:    x, z, w   
y, z, w
Allowed substitution hints:    ph( x, y, z, w)    ps( x, y, z, w)

Proof of Theorem cbvoprab3
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 nfv 1508 . . . . . 6  |-  F/ w  v  =  <. x ,  y >.
2 cbvoprab3.1 . . . . . 6  |-  F/ w ph
31, 2nfan 1544 . . . . 5  |-  F/ w
( v  =  <. x ,  y >.  /\  ph )
43nfex 1616 . . . 4  |-  F/ w E. y ( v  = 
<. x ,  y >.  /\  ph )
54nfex 1616 . . 3  |-  F/ w E. x E. y ( v  =  <. x ,  y >.  /\  ph )
6 nfv 1508 . . . . . 6  |-  F/ z  v  =  <. x ,  y >.
7 cbvoprab3.2 . . . . . 6  |-  F/ z ps
86, 7nfan 1544 . . . . 5  |-  F/ z ( v  =  <. x ,  y >.  /\  ps )
98nfex 1616 . . . 4  |-  F/ z E. y ( v  =  <. x ,  y
>.  /\  ps )
109nfex 1616 . . 3  |-  F/ z E. x E. y
( v  =  <. x ,  y >.  /\  ps )
11 cbvoprab3.3 . . . . 5  |-  ( z  =  w  ->  ( ph 
<->  ps ) )
1211anbi2d 459 . . . 4  |-  ( z  =  w  ->  (
( v  =  <. x ,  y >.  /\  ph ) 
<->  ( v  =  <. x ,  y >.  /\  ps ) ) )
13122exbidv 1840 . . 3  |-  ( z  =  w  ->  ( E. x E. y ( v  =  <. x ,  y >.  /\  ph ) 
<->  E. x E. y
( v  =  <. x ,  y >.  /\  ps ) ) )
145, 10, 13cbvopab2 3997 . 2  |-  { <. v ,  z >.  |  E. x E. y ( v  =  <. x ,  y
>.  /\  ph ) }  =  { <. v ,  w >.  |  E. x E. y ( v  =  <. x ,  y
>.  /\  ps ) }
15 dfoprab2 5811 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. v ,  z >.  |  E. x E. y ( v  =  <. x ,  y
>.  /\  ph ) }
16 dfoprab2 5811 . 2  |-  { <. <.
x ,  y >. ,  w >.  |  ps }  =  { <. v ,  w >.  |  E. x E. y ( v  =  <. x ,  y
>.  /\  ps ) }
1714, 15, 163eqtr4i 2168 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  w >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   F/wnf 1436   E.wex 1468   <.cop 3525   {copab 3983   {coprab 5768
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985  df-oprab 5771
This theorem is referenced by:  cbvoprab3v  5841  tposoprab  6170  erovlem  6514
  Copyright terms: Public domain W3C validator