MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbceqg Unicode version

Theorem sbceqg 3110
Description: Distribute proper substitution through an equality relation. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
sbceqg  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  =  C  <->  [_ A  /  x ]_ B  =  [_ A  /  x ]_ C ) )

Proof of Theorem sbceqg
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsbcq2 3007 . . 3  |-  ( z  =  A  ->  ( [ z  /  x ] B  =  C  <->  [. A  /  x ]. B  =  C )
)
2 dfsbcq2 3007 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  B  <->  [. A  /  x ]. y  e.  B )
)
32abbidv 2410 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  B }  =  { y  |  [. A  /  x ]. y  e.  B } )
4 dfsbcq2 3007 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  C  <->  [. A  /  x ]. y  e.  C )
)
54abbidv 2410 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  C }  =  { y  |  [. A  /  x ]. y  e.  C } )
63, 5eqeq12d 2310 . . 3  |-  ( z  =  A  ->  ( { y  |  [
z  /  x ]
y  e.  B }  =  { y  |  [
z  /  x ]
y  e.  C }  <->  { y  |  [. A  /  x ]. y  e.  B }  =  {
y  |  [. A  /  x ]. y  e.  C } ) )
7 nfs1v 2058 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  B
87nfab 2436 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  B }
9 nfs1v 2058 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  C
109nfab 2436 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  C }
118, 10nfeq 2439 . . . 4  |-  F/ x { y  |  [
z  /  x ]
y  e.  B }  =  { y  |  [
z  /  x ]
y  e.  C }
12 sbab 2418 . . . . 5  |-  ( x  =  z  ->  B  =  { y  |  [
z  /  x ]
y  e.  B }
)
13 sbab 2418 . . . . 5  |-  ( x  =  z  ->  C  =  { y  |  [
z  /  x ]
y  e.  C }
)
1412, 13eqeq12d 2310 . . . 4  |-  ( x  =  z  ->  ( B  =  C  <->  { y  |  [ z  /  x ] y  e.  B }  =  { y  |  [ z  /  x ] y  e.  C } ) )
1511, 14sbie 1991 . . 3  |-  ( [ z  /  x ] B  =  C  <->  { y  |  [ z  /  x ] y  e.  B }  =  { y  |  [ z  /  x ] y  e.  C } )
161, 6, 15vtoclbg 2857 . 2  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  =  C  <->  { y  |  [. A  /  x ]. y  e.  B }  =  {
y  |  [. A  /  x ]. y  e.  C } ) )
17 df-csb 3095 . . 3  |-  [_ A  /  x ]_ B  =  { y  |  [. A  /  x ]. y  e.  B }
18 df-csb 3095 . . 3  |-  [_ A  /  x ]_ C  =  { y  |  [. A  /  x ]. y  e.  C }
1917, 18eqeq12i 2309 . 2  |-  ( [_ A  /  x ]_ B  =  [_ A  /  x ]_ C  <->  { y  |  [. A  /  x ]. y  e.  B }  =  {
y  |  [. A  /  x ]. y  e.  C } )
2016, 19syl6bbr 254 1  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  =  C  <->  [_ A  /  x ]_ B  =  [_ A  /  x ]_ C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    = wceq 1632   [wsb 1638    e. wcel 1696   {cab 2282   [.wsbc 3004   [_csb 3094
This theorem is referenced by:  sbcne12g  3112  sbceq1g  3114  sbceq2g  3116  csbfv12gALT  5552  sbcfun  28090  onfrALTlem5  28606  onfrALTlem4  28607  csbeq2g  28614  csbingVD  28976  onfrALTlem5VD  28977  onfrALTlem4VD  28978  csbeq2gVD  28984  csbsngVD  28985  csbunigVD  28990  csbfv12gALTVD  28991  cdlemk42  31752
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803  df-sbc 3005  df-csb 3095
  Copyright terms: Public domain W3C validator