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

Theorem cbvoprab3v 5841
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 1508 . 2  |-  F/ w ph
2 nfv 1508 . 2  |-  F/ z ps
3 cbvoprab3v.1 . 2  |-  ( z  =  w  ->  ( ph 
<->  ps ) )
41, 2, 3cbvoprab3 5840 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  w >.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1331   {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: (None)
  Copyright terms: Public domain W3C validator