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

Theorem cbviinv 4047
Description: Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.)
Hypothesis
Ref Expression
cbviunv.1  |-  ( x  =  y  ->  B  =  C )
Assertion
Ref Expression
cbviinv  |-  |^|_ x  e.  A  B  =  |^|_ y  e.  A  C
Distinct variable groups:    x, A    y, A    y, B    x, C
Allowed substitution hints:    B( x)    C( y)

Proof of Theorem cbviinv
StepHypRef Expression
1 nfcv 2392 . 2  |-  F/_ y B
2 nfcv 2392 . 2  |-  F/_ x C
3 cbviunv.1 . 2  |-  ( x  =  y  ->  B  =  C )
41, 2, 3cbviin 4045 1  |-  |^|_ x  e.  A  B  =  |^|_ y  e.  A  C
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402   |^|_ciin 4008
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-iin 4010
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator