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

Theorem cbvriotav 5499
Description: Change bound variable in a restricted description binder. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypothesis
Ref Expression
cbvriotav.1  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvriotav  |-  ( iota_ x  e.  A  ph )  =  ( iota_ y  e.  A  ps )
Distinct variable groups:    x, A    y, A    ph, y    ps, x
Allowed substitution hints:    ph( x)    ps( y)

Proof of Theorem cbvriotav
StepHypRef Expression
1 nfv 1461 . 2  |-  F/ y
ph
2 nfv 1461 . 2  |-  F/ x ps
3 cbvriotav.1 . 2  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
41, 2, 3cbvriota 5498 1  |-  ( iota_ x  e.  A  ph )  =  ( iota_ y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    = wceq 1284   iota_crio 5487
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-sn 3404  df-uni 3602  df-iota 4887  df-riota 5488
This theorem is referenced by:  axcaucvg  7066
  Copyright terms: Public domain W3C validator