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

Theorem cbvrabcsf 2939
Description: A more general version of cbvrab 2572 with no distinct variable restrictions. (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
cbvrabcsf  |-  { x  e.  A  |  ph }  =  { y  e.  B  |  ps }

Proof of Theorem cbvrabcsf
Dummy variables  v  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1437 . . . 4  |-  F/ z ( x  e.  A  /\  ph )
2 nfcsb1v 2910 . . . . . 6  |-  F/_ x [_ z  /  x ]_ A
32nfcri 2188 . . . . 5  |-  F/ x  z  e.  [_ z  /  x ]_ A
4 nfs1v 1831 . . . . 5  |-  F/ x [ z  /  x ] ph
53, 4nfan 1473 . . . 4  |-  F/ x
( z  e.  [_ z  /  x ]_ A  /\  [ z  /  x ] ph )
6 id 19 . . . . . 6  |-  ( x  =  z  ->  x  =  z )
7 csbeq1a 2888 . . . . . 6  |-  ( x  =  z  ->  A  =  [_ z  /  x ]_ A )
86, 7eleq12d 2124 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  [_ z  /  x ]_ A ) )
9 sbequ12 1670 . . . . 5  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
108, 9anbi12d 450 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  /\  ph )  <->  ( z  e.  [_ z  /  x ]_ A  /\  [ z  /  x ] ph ) ) )
111, 5, 10cbvab 2176 . . 3  |-  { x  |  ( x  e.  A  /\  ph ) }  =  { z  |  ( z  e. 
[_ z  /  x ]_ A  /\  [ z  /  x ] ph ) }
12 nfcv 2194 . . . . . . 7  |-  F/_ y
z
13 cbvralcsf.1 . . . . . . 7  |-  F/_ y A
1412, 13nfcsb 2912 . . . . . 6  |-  F/_ y [_ z  /  x ]_ A
1514nfcri 2188 . . . . 5  |-  F/ y  z  e.  [_ z  /  x ]_ A
16 cbvralcsf.3 . . . . . 6  |-  F/ y
ph
1716nfsb 1838 . . . . 5  |-  F/ y [ z  /  x ] ph
1815, 17nfan 1473 . . . 4  |-  F/ y ( z  e.  [_ z  /  x ]_ A  /\  [ z  /  x ] ph )
19 nfv 1437 . . . 4  |-  F/ z ( y  e.  B  /\  ps )
20 id 19 . . . . . 6  |-  ( z  =  y  ->  z  =  y )
21 csbeq1 2883 . . . . . . 7  |-  ( z  =  y  ->  [_ z  /  x ]_ A  = 
[_ y  /  x ]_ A )
22 df-csb 2881 . . . . . . . 8  |-  [_ y  /  x ]_ A  =  { v  |  [. y  /  x ]. v  e.  A }
23 cbvralcsf.2 . . . . . . . . . . . 12  |-  F/_ x B
2423nfcri 2188 . . . . . . . . . . 11  |-  F/ x  v  e.  B
25 cbvralcsf.5 . . . . . . . . . . . 12  |-  ( x  =  y  ->  A  =  B )
2625eleq2d 2123 . . . . . . . . . . 11  |-  ( x  =  y  ->  (
v  e.  A  <->  v  e.  B ) )
2724, 26sbie 1690 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  v  e.  B )
28 sbsbc 2791 . . . . . . . . . 10  |-  ( [ y  /  x ]
v  e.  A  <->  [. y  /  x ]. v  e.  A
)
2927, 28bitr3i 179 . . . . . . . . 9  |-  ( v  e.  B  <->  [. y  /  x ]. v  e.  A
)
3029abbi2i 2168 . . . . . . . 8  |-  B  =  { v  |  [. y  /  x ]. v  e.  A }
3122, 30eqtr4i 2079 . . . . . . 7  |-  [_ y  /  x ]_ A  =  B
3221, 31syl6eq 2104 . . . . . 6  |-  ( z  =  y  ->  [_ z  /  x ]_ A  =  B )
3320, 32eleq12d 2124 . . . . 5  |-  ( z  =  y  ->  (
z  e.  [_ z  /  x ]_ A  <->  y  e.  B ) )
34 sbequ 1737 . . . . . 6  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  [ y  /  x ] ph ) )
35 cbvralcsf.4 . . . . . . 7  |-  F/ x ps
36 cbvralcsf.6 . . . . . . 7  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
3735, 36sbie 1690 . . . . . 6  |-  ( [ y  /  x ] ph 
<->  ps )
3834, 37syl6bb 189 . . . . 5  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  ps ) )
3933, 38anbi12d 450 . . . 4  |-  ( z  =  y  ->  (
( z  e.  [_ z  /  x ]_ A  /\  [ z  /  x ] ph )  <->  ( y  e.  B  /\  ps )
) )
4018, 19, 39cbvab 2176 . . 3  |-  { z  |  ( z  e. 
[_ z  /  x ]_ A  /\  [ z  /  x ] ph ) }  =  {
y  |  ( y  e.  B  /\  ps ) }
4111, 40eqtri 2076 . 2  |-  { x  |  ( x  e.  A  /\  ph ) }  =  { y  |  ( y  e.  B  /\  ps ) }
42 df-rab 2332 . 2  |-  { x  e.  A  |  ph }  =  { x  |  ( x  e.  A  /\  ph ) }
43 df-rab 2332 . 2  |-  { y  e.  B  |  ps }  =  { y  |  ( y  e.  B  /\  ps ) }
4441, 42, 433eqtr4i 2086 1  |-  { x  e.  A  |  ph }  =  { y  e.  B  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102    = wceq 1259   F/wnf 1365    e. wcel 1409   [wsb 1661   {cab 2042   F/_wnfc 2181   {crab 2327   [.wsbc 2787   [_csb 2880
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-rab 2332  df-sbc 2788  df-csb 2881
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator