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

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

Proof of Theorem sbcel12g
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsbcq2 3028 . . 3  |-  ( z  =  A  ->  ( [ z  /  x ] B  e.  C  <->  [. A  /  x ]. B  e.  C )
)
2 dfsbcq2 3028 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  B  <->  [. A  /  x ]. y  e.  B )
)
32abbidv 2430 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  B }  =  { y  |  [. A  /  x ]. y  e.  B } )
4 dfsbcq2 3028 . . . . 5  |-  ( z  =  A  ->  ( [ z  /  x ] y  e.  C  <->  [. A  /  x ]. y  e.  C )
)
54abbidv 2430 . . . 4  |-  ( z  =  A  ->  { y  |  [ z  /  x ] y  e.  C }  =  { y  |  [. A  /  x ]. y  e.  C } )
63, 5eleq12d 2384 . . 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 2078 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  B
87nfab 2456 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  B }
9 nfs1v 2078 . . . . . 6  |-  F/ x [ z  /  x ] y  e.  C
109nfab 2456 . . . . 5  |-  F/_ x { y  |  [
z  /  x ]
y  e.  C }
118, 10nfel 2460 . . . 4  |-  F/ x { y  |  [
z  /  x ]
y  e.  B }  e.  { y  |  [
z  /  x ]
y  e.  C }
12 sbab 2438 . . . . 5  |-  ( x  =  z  ->  B  =  { y  |  [
z  /  x ]
y  e.  B }
)
13 sbab 2438 . . . . 5  |-  ( x  =  z  ->  C  =  { y  |  [
z  /  x ]
y  e.  C }
)
1412, 13eleq12d 2384 . . . 4  |-  ( x  =  z  ->  ( B  e.  C  <->  { y  |  [ z  /  x ] y  e.  B }  e.  { y  |  [ z  /  x ] y  e.  C } ) )
1511, 14sbie 2010 . . 3  |-  ( [ z  /  x ] B  e.  C  <->  { y  |  [ z  /  x ] y  e.  B }  e.  { y  |  [ z  /  x ] y  e.  C } )
161, 6, 15vtoclbg 2878 . 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 3116 . . 3  |-  [_ A  /  x ]_ B  =  { y  |  [. A  /  x ]. y  e.  B }
18 df-csb 3116 . . 3  |-  [_ A  /  x ]_ C  =  { y  |  [. A  /  x ]. y  e.  C }
1917, 18eleq12i 2381 . 2  |-  ( [_ A  /  x ]_ B  e.  [_ A  /  x ]_ C  <->  { y  |  [. A  /  x ]. y  e.  B }  e.  {
y  |  [. A  /  x ]. y  e.  C } )
2016, 19syl6bbr 254 1  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  e.  C  <->  [_ A  /  x ]_ B  e.  [_ A  /  x ]_ C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    = wceq 1633   [wsb 1639    e. wcel 1701   {cab 2302   [.wsbc 3025   [_csb 3115
This theorem is referenced by:  sbcnel12g  3132  sbcel1g  3134  sbcel2g  3136  sbccsb2g  3144  fmptdF  23218  csbxpgVD  28181  csbrngVD  28183
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-v 2824  df-sbc 3026  df-csb 3116
  Copyright terms: Public domain W3C validator