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

Theorem cbvoprab3v 6045
Description: Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 8-Oct-2004.) (Revised by David Abernethy, 19-Jun-2012.)
Hypothesis
Ref Expression
cbvoprab3v.1  |-  ( z  =  w  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvoprab3v  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  w >.  |  ps }
Distinct variable groups:    x, z, w   
y, z, w    ph, w    ps, z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, w)

Proof of Theorem cbvoprab3v
StepHypRef Expression
1 nfv 1552 . 2  |-  F/ w ph
2 nfv 1552 . 2  |-  F/ z ps
3 cbvoprab3v.1 . 2  |-  ( z  =  w  ->  ( ph 
<->  ps ) )
41, 2, 3cbvoprab3 6044 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  w >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1373   {coprab 5968
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-opab 4122  df-oprab 5971
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator