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

Theorem cbvralcsf 2964
Description: A more general version of cbvralf 2571 that doesn't require  A and  B to be distinct from  x or  y. Changes bound variables using implicit substitution. (Contributed by Andrew Salmon, 13-Jul-2011.)
Hypotheses
Ref Expression
cbvralcsf.1  |-  F/_ y A
cbvralcsf.2  |-  F/_ x B
cbvralcsf.3  |-  F/ y
ph
cbvralcsf.4  |-  F/ x ps
cbvralcsf.5  |-  ( x  =  y  ->  A  =  B )
cbvralcsf.6  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvralcsf  |-  ( A. x  e.  A  ph  <->  A. y  e.  B  ps )

Proof of Theorem cbvralcsf
Dummy variables  v  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1461 . . . 4  |-  F/ z ( x  e.  A  ->  ph )
2 nfcsb1v 2938 . . . . . 6  |-  F/_ x [_ z  /  x ]_ A
32nfcri 2213 . . . . 5  |-  F/ x  z  e.  [_ z  /  x ]_ A
4 nfsbc1v 2833 . . . . 5  |-  F/ x [. z  /  x ]. ph
53, 4nfim 1504 . . . 4  |-  F/ x
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
6 id 19 . . . . . 6  |-  ( x  =  z  ->  x  =  z )
7 csbeq1a 2916 . . . . . 6  |-  ( x  =  z  ->  A  =  [_ z  /  x ]_ A )
86, 7eleq12d 2149 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  [_ z  /  x ]_ A ) )
9 sbceq1a 2824 . . . . 5  |-  ( x  =  z  ->  ( ph 
<-> 
[. z  /  x ]. ph ) )
108, 9imbi12d 232 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  ->  ph )  <->  ( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
) )
111, 5, 10cbval 1677 . . 3  |-  ( A. x ( x  e.  A  ->  ph )  <->  A. z
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph ) )
12 nfcv 2219 . . . . . . 7  |-  F/_ y
z
13 cbvralcsf.1 . . . . . . 7  |-  F/_ y A
1412, 13nfcsb 2940 . . . . . 6  |-  F/_ y [_ z  /  x ]_ A
1514nfcri 2213 . . . . 5  |-  F/ y  z  e.  [_ z  /  x ]_ A
16 cbvralcsf.3 . . . . . 6  |-  F/ y
ph
1712, 16nfsbc 2835 . . . . 5  |-  F/ y
[. z  /  x ]. ph
1815, 17nfim 1504 . . . 4  |-  F/ y ( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
19 nfv 1461 . . . 4  |-  F/ z ( y  e.  B  ->  ps )
20 id 19 . . . . . 6  |-  ( z  =  y  ->  z  =  y )
21 csbeq1 2911 . . . . . . 7  |-  ( z  =  y  ->  [_ z  /  x ]_ A  = 
[_ y  /  x ]_ A )
22 df-csb 2909 . . . . . . . 8  |-  [_ y  /  x ]_ A  =  { v  |  [. y  /  x ]. v  e.  A }
23 cbvralcsf.2 . . . . . . . . . . . 12  |-  F/_ x B
2423nfcri 2213 . . . . . . . . . . 11  |-  F/ x  v  e.  B
25 cbvralcsf.5 . . . . . . . . . . . 12  |-  ( x  =  y  ->  A  =  B )
2625eleq2d 2148 . . . . . . . . . . 11  |-  ( x  =  y  ->  (
v  e.  A  <->  v  e.  B ) )
2724, 26sbie 1714 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  v  e.  B )
28 sbsbc 2819 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  [. y  /  x ]. v  e.  A
)
2927, 28bitr3i 184 . . . . . . . . 9  |-  ( v  e.  B  <->  [. y  /  x ]. v  e.  A
)
3029abbi2i 2193 . . . . . . . 8  |-  B  =  { v  |  [. y  /  x ]. v  e.  A }
3122, 30eqtr4i 2104 . . . . . . 7  |-  [_ y  /  x ]_ A  =  B
3221, 31syl6eq 2129 . . . . . 6  |-  ( z  =  y  ->  [_ z  /  x ]_ A  =  B )
3320, 32eleq12d 2149 . . . . 5  |-  ( z  =  y  ->  (
z  e.  [_ z  /  x ]_ A  <->  y  e.  B ) )
34 dfsbcq 2817 . . . . . 6  |-  ( z  =  y  ->  ( [. z  /  x ]. ph  <->  [. y  /  x ]. ph ) )
35 sbsbc 2819 . . . . . . 7  |-  ( [ y  /  x ] ph 
<-> 
[. y  /  x ]. ph )
36 cbvralcsf.4 . . . . . . . 8  |-  F/ x ps
37 cbvralcsf.6 . . . . . . . 8  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
3836, 37sbie 1714 . . . . . . 7  |-  ( [ y  /  x ] ph 
<->  ps )
3935, 38bitr3i 184 . . . . . 6  |-  ( [. y  /  x ]. ph  <->  ps )
4034, 39syl6bb 194 . . . . 5  |-  ( z  =  y  ->  ( [. z  /  x ]. ph  <->  ps ) )
4133, 40imbi12d 232 . . . 4  |-  ( z  =  y  ->  (
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )  <->  ( y  e.  B  ->  ps )
) )
4218, 19, 41cbval 1677 . . 3  |-  ( A. z ( z  e. 
[_ z  /  x ]_ A  ->  [. z  /  x ]. ph )  <->  A. y ( y  e.  B  ->  ps )
)
4311, 42bitri 182 . 2  |-  ( A. x ( x  e.  A  ->  ph )  <->  A. y
( y  e.  B  ->  ps ) )
44 df-ral 2353 . 2  |-  ( A. x  e.  A  ph  <->  A. x
( x  e.  A  ->  ph ) )
45 df-ral 2353 . 2  |-  ( A. y  e.  B  ps  <->  A. y ( y  e.  B  ->  ps )
)
4643, 44, 453bitr4i 210 1  |-  ( A. x  e.  A  ph  <->  A. y  e.  B  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103   A.wal 1282    = wceq 1284   F/wnf 1389    e. wcel 1433   [wsb 1685   {cab 2067   F/_wnfc 2206   A.wral 2348   [.wsbc 2815   [_csb 2908
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-ral 2353  df-sbc 2816  df-csb 2909
This theorem is referenced by:  cbvralv2  2968
  Copyright terms: Public domain W3C validator