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

Theorem sbcel12gOLD 3824
Description: Distribute proper substitution through a membership relation. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) Obsolete as of 18-Aug-2018. Use sbcel12 3823 instead. (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
sbcel12gOLD  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  e.  C  <->  [_ A  /  x ]_ B  e.  [_ A  /  x ]_ C ) )

Proof of Theorem sbcel12gOLD
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsbcq2 3334 . . 3  |-  ( z  =  A  ->  ( [ z  /  x ] B  e.  C  <->  [. A  /  x ]. B  e.  C )
)
2 dfsbcq2 3334 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  B  <->  [. A  /  x ]. y  e.  B )
)
32abbidv 2603 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  B }  =  { y  |  [. A  /  x ]. y  e.  B } )
4 dfsbcq2 3334 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  C  <->  [. A  /  x ]. y  e.  C )
)
54abbidv 2603 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  C }  =  { y  |  [. A  /  x ]. y  e.  C } )
63, 5eleq12d 2549 . . 3  |-  ( z  =  A  ->  ( { y  |  [
z  /  x ]
y  e.  B }  e.  { y  |  [
z  /  x ]
y  e.  C }  <->  { y  |  [. A  /  x ]. y  e.  B }  e.  {
y  |  [. A  /  x ]. y  e.  C } ) )
7 nfs1v 2164 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  B
87nfab 2633 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  B }
9 nfs1v 2164 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  C
109nfab 2633 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  C }
118, 10nfel 2642 . . . 4  |-  F/ x { y  |  [
z  /  x ]
y  e.  B }  e.  { y  |  [
z  /  x ]
y  e.  C }
12 sbab 2614 . . . . 5  |-  ( x  =  z  ->  B  =  { y  |  [
z  /  x ]
y  e.  B }
)
13 sbab 2614 . . . . 5  |-  ( x  =  z  ->  C  =  { y  |  [
z  /  x ]
y  e.  C }
)
1412, 13eleq12d 2549 . . . 4  |-  ( x  =  z  ->  ( B  e.  C  <->  { y  |  [ z  /  x ] y  e.  B }  e.  { y  |  [ z  /  x ] y  e.  C } ) )
1511, 14sbie 2123 . . 3  |-  ( [ z  /  x ] B  e.  C  <->  { y  |  [ z  /  x ] y  e.  B }  e.  { y  |  [ z  /  x ] y  e.  C } )
161, 6, 15vtoclbg 3172 . 2  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  e.  C  <->  { y  |  [. A  /  x ]. y  e.  B }  e.  {
y  |  [. A  /  x ]. y  e.  C } ) )
17 df-csb 3436 . . 3  |-  [_ A  /  x ]_ B  =  { y  |  [. A  /  x ]. y  e.  B }
18 df-csb 3436 . . 3  |-  [_ A  /  x ]_ C  =  { y  |  [. A  /  x ]. y  e.  C }
1917, 18eleq12i 2546 . 2  |-  ( [_ A  /  x ]_ B  e.  [_ A  /  x ]_ C  <->  { y  |  [. A  /  x ]. y  e.  B }  e.  {
y  |  [. A  /  x ]. y  e.  C } )
2016, 19syl6bbr 263 1  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  e.  C  <->  [_ A  /  x ]_ B  e.  [_ A  /  x ]_ C ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    = wceq 1379   [wsb 1711    e. wcel 1767   {cab 2452   [.wsbc 3331   [_csb 3435
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-v 3115  df-sbc 3332  df-csb 3436
This theorem is referenced by:  sbcel2gOLD  3832  sbccsb2gOLD  3852  csbxpgVD  32774  csbrngVD  32776
  Copyright terms: Public domain W3C validator