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

Theorem cbvralcsf 3093
Description: A more general version of cbvralf 2674 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 1508 . . . 4  |-  F/ z ( x  e.  A  ->  ph )
2 nfcsb1v 3064 . . . . . 6  |-  F/_ x [_ z  /  x ]_ A
32nfcri 2293 . . . . 5  |-  F/ x  z  e.  [_ z  /  x ]_ A
4 nfsbc1v 2955 . . . . 5  |-  F/ x [. z  /  x ]. ph
53, 4nfim 1552 . . . 4  |-  F/ x
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
6 id 19 . . . . . 6  |-  ( x  =  z  ->  x  =  z )
7 csbeq1a 3040 . . . . . 6  |-  ( x  =  z  ->  A  =  [_ z  /  x ]_ A )
86, 7eleq12d 2228 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  [_ z  /  x ]_ A ) )
9 sbceq1a 2946 . . . . 5  |-  ( x  =  z  ->  ( ph 
<-> 
[. z  /  x ]. ph ) )
108, 9imbi12d 233 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  ->  ph )  <->  ( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
) )
111, 5, 10cbval 1734 . . 3  |-  ( A. x ( x  e.  A  ->  ph )  <->  A. z
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph ) )
12 nfcv 2299 . . . . . . 7  |-  F/_ y
z
13 cbvralcsf.1 . . . . . . 7  |-  F/_ y A
1412, 13nfcsb 3068 . . . . . 6  |-  F/_ y [_ z  /  x ]_ A
1514nfcri 2293 . . . . 5  |-  F/ y  z  e.  [_ z  /  x ]_ A
16 cbvralcsf.3 . . . . . 6  |-  F/ y
ph
1712, 16nfsbc 2957 . . . . 5  |-  F/ y
[. z  /  x ]. ph
1815, 17nfim 1552 . . . 4  |-  F/ y ( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )
19 nfv 1508 . . . 4  |-  F/ z ( y  e.  B  ->  ps )
20 id 19 . . . . . 6  |-  ( z  =  y  ->  z  =  y )
21 csbeq1 3034 . . . . . . 7  |-  ( z  =  y  ->  [_ z  /  x ]_ A  = 
[_ y  /  x ]_ A )
22 df-csb 3032 . . . . . . . 8  |-  [_ y  /  x ]_ A  =  { v  |  [. y  /  x ]. v  e.  A }
23 cbvralcsf.2 . . . . . . . . . . . 12  |-  F/_ x B
2423nfcri 2293 . . . . . . . . . . 11  |-  F/ x  v  e.  B
25 cbvralcsf.5 . . . . . . . . . . . 12  |-  ( x  =  y  ->  A  =  B )
2625eleq2d 2227 . . . . . . . . . . 11  |-  ( x  =  y  ->  (
v  e.  A  <->  v  e.  B ) )
2724, 26sbie 1771 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  v  e.  B )
28 sbsbc 2941 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  [. y  /  x ]. v  e.  A
)
2927, 28bitr3i 185 . . . . . . . . 9  |-  ( v  e.  B  <->  [. y  /  x ]. v  e.  A
)
3029abbi2i 2272 . . . . . . . 8  |-  B  =  { v  |  [. y  /  x ]. v  e.  A }
3122, 30eqtr4i 2181 . . . . . . 7  |-  [_ y  /  x ]_ A  =  B
3221, 31eqtrdi 2206 . . . . . 6  |-  ( z  =  y  ->  [_ z  /  x ]_ A  =  B )
3320, 32eleq12d 2228 . . . . 5  |-  ( z  =  y  ->  (
z  e.  [_ z  /  x ]_ A  <->  y  e.  B ) )
34 dfsbcq 2939 . . . . . 6  |-  ( z  =  y  ->  ( [. z  /  x ]. ph  <->  [. y  /  x ]. ph ) )
35 sbsbc 2941 . . . . . . 7  |-  ( [ y  /  x ] ph 
<-> 
[. y  /  x ]. ph )
36 cbvralcsf.4 . . . . . . . 8  |-  F/ x ps
37 cbvralcsf.6 . . . . . . . 8  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
3836, 37sbie 1771 . . . . . . 7  |-  ( [ y  /  x ] ph 
<->  ps )
3935, 38bitr3i 185 . . . . . 6  |-  ( [. y  /  x ]. ph  <->  ps )
4034, 39bitrdi 195 . . . . 5  |-  ( z  =  y  ->  ( [. z  /  x ]. ph  <->  ps ) )
4133, 40imbi12d 233 . . . 4  |-  ( z  =  y  ->  (
( z  e.  [_ z  /  x ]_ A  ->  [. z  /  x ]. ph )  <->  ( y  e.  B  ->  ps )
) )
4218, 19, 41cbval 1734 . . 3  |-  ( A. z ( z  e. 
[_ z  /  x ]_ A  ->  [. z  /  x ]. ph )  <->  A. y ( y  e.  B  ->  ps )
)
4311, 42bitri 183 . 2  |-  ( A. x ( x  e.  A  ->  ph )  <->  A. y
( y  e.  B  ->  ps ) )
44 df-ral 2440 . 2  |-  ( A. x  e.  A  ph  <->  A. x
( x  e.  A  ->  ph ) )
45 df-ral 2440 . 2  |-  ( A. y  e.  B  ps  <->  A. y ( y  e.  B  ->  ps )
)
4643, 44, 453bitr4i 211 1  |-  ( A. x  e.  A  ph  <->  A. y  e.  B  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1333    = wceq 1335   F/wnf 1440   [wsb 1742    e. wcel 2128   {cab 2143   F/_wnfc 2286   A.wral 2435   [.wsbc 2937   [_csb 3031
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 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2139
This theorem depends on definitions:  df-bi 116  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-sbc 2938  df-csb 3032
This theorem is referenced by:  cbvralv2  3097
  Copyright terms: Public domain W3C validator