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

Theorem cbvopab2v 4081
Description: Rule used to change the second bound variable in an ordered pair abstraction, using implicit substitution. (Contributed by NM, 2-Sep-1999.)
Hypothesis
Ref Expression
cbvopab2v.1  |-  ( y  =  z  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvopab2v  |-  { <. x ,  y >.  |  ph }  =  { <. x ,  z >.  |  ps }
Distinct variable groups:    x, y, z    ph, z    ps, y
Allowed substitution hints:    ph( x, y)    ps( x, z)

Proof of Theorem cbvopab2v
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 opeq2 3780 . . . . . . 7  |-  ( y  =  z  ->  <. x ,  y >.  =  <. x ,  z >. )
21eqeq2d 2189 . . . . . 6  |-  ( y  =  z  ->  (
w  =  <. x ,  y >.  <->  w  =  <. x ,  z >.
) )
3 cbvopab2v.1 . . . . . 6  |-  ( y  =  z  ->  ( ph 
<->  ps ) )
42, 3anbi12d 473 . . . . 5  |-  ( y  =  z  ->  (
( w  =  <. x ,  y >.  /\  ph ) 
<->  ( w  =  <. x ,  z >.  /\  ps ) ) )
54cbvexv 1918 . . . 4  |-  ( E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  E. z
( w  =  <. x ,  z >.  /\  ps ) )
65exbii 1605 . . 3  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph ) 
<->  E. x E. z
( w  =  <. x ,  z >.  /\  ps ) )
76abbii 2293 . 2  |-  { w  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }  =  {
w  |  E. x E. z ( w  = 
<. x ,  z >.  /\  ps ) }
8 df-opab 4066 . 2  |-  { <. x ,  y >.  |  ph }  =  { w  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }
9 df-opab 4066 . 2  |-  { <. x ,  z >.  |  ps }  =  { w  |  E. x E. z
( w  =  <. x ,  z >.  /\  ps ) }
107, 8, 93eqtr4i 2208 1  |-  { <. x ,  y >.  |  ph }  =  { <. x ,  z >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   E.wex 1492   {cab 2163   <.cop 3596   {copab 4064
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-ext 2159
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 2740  df-un 3134  df-sn 3599  df-pr 3600  df-op 3602  df-opab 4066
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator