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

Theorem csbresg 5089
Description: Distribute proper substitution through the restriction of a class. csbresg 5089 is derived from the virtual deduction proof csbresgVD 28348. (Contributed by Alan Sare, 10-Nov-2012.)
Assertion
Ref Expression
csbresg  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( B  |`  C )  =  (
[_ A  /  x ]_ B  |`  [_ A  /  x ]_ C ) )

Proof of Theorem csbresg
StepHypRef Expression
1 csbing 3491 . . 3  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( B  i^i  ( C  X.  _V ) )  =  (
[_ A  /  x ]_ B  i^i  [_ A  /  x ]_ ( C  X.  _V ) ) )
2 csbxpg 4845 . . . . 5  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( C  X.  _V )  =  ( [_ A  /  x ]_ C  X.  [_ A  /  x ]_ _V ) )
3 csbconstg 3208 . . . . . 6  |-  ( A  e.  V  ->  [_ A  /  x ]_ _V  =  _V )
43xpeq2d 4842 . . . . 5  |-  ( A  e.  V  ->  ( [_ A  /  x ]_ C  X.  [_ A  /  x ]_ _V )  =  ( [_ A  /  x ]_ C  X.  _V ) )
52, 4eqtrd 2419 . . . 4  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( C  X.  _V )  =  ( [_ A  /  x ]_ C  X.  _V ) )
65ineq2d 3485 . . 3  |-  ( A  e.  V  ->  ( [_ A  /  x ]_ B  i^i  [_ A  /  x ]_ ( C  X.  _V ) )  =  ( [_ A  /  x ]_ B  i^i  ( [_ A  /  x ]_ C  X.  _V )
) )
71, 6eqtrd 2419 . 2  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( B  i^i  ( C  X.  _V ) )  =  (
[_ A  /  x ]_ B  i^i  ( [_ A  /  x ]_ C  X.  _V )
) )
8 df-res 4830 . . 3  |-  ( B  |`  C )  =  ( B  i^i  ( C  X.  _V ) )
98csbeq2i 3220 . 2  |-  [_ A  /  x ]_ ( B  |`  C )  =  [_ A  /  x ]_ ( B  i^i  ( C  X.  _V ) )
10 df-res 4830 . 2  |-  ( [_ A  /  x ]_ B  |` 
[_ A  /  x ]_ C )  =  (
[_ A  /  x ]_ B  i^i  ( [_ A  /  x ]_ C  X.  _V )
)
117, 9, 103eqtr4g 2444 1  |-  ( A  e.  V  ->  [_ A  /  x ]_ ( B  |`  C )  =  (
[_ A  /  x ]_ B  |`  [_ A  /  x ]_ C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1649    e. wcel 1717   _Vcvv 2899   [_csb 3194    i^i cin 3262    X. cxp 4816    |` cres 4820
This theorem is referenced by:  csbima12gALT  5154  csbima12gALTVD  28350
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-rab 2658  df-v 2901  df-sbc 3105  df-csb 3195  df-in 3270  df-opab 4208  df-xp 4824  df-res 4830
  Copyright terms: Public domain W3C validator