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

Theorem sbcssg 3603
Description: Distribute proper substitution through a subclass relation. (Contributed by Alan Sare, 22-Jul-2012.) (Proof shortened by Alexander van der Vekens, 23-Jul-2017.)
Assertion
Ref Expression
sbcssg  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  C_  C  <->  [_ A  /  x ]_ B  C_  [_ A  /  x ]_ C ) )

Proof of Theorem sbcssg
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 sbcalg 3084 . . 3  |-  ( A  e.  V  ->  ( [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C )  <->  A. y [. A  /  x ]. ( y  e.  B  ->  y  e.  C ) ) )
2 sbcimg 3073 . . . . 5  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( [. A  /  x ]. y  e.  B  ->  [. A  /  x ]. y  e.  C
) ) )
3 sbcel2g 3148 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  B  <->  y  e.  [_ A  /  x ]_ B ) )
4 sbcel2g 3148 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  C  <->  y  e.  [_ A  /  x ]_ C ) )
53, 4imbi12d 234 . . . . 5  |-  ( A  e.  V  ->  (
( [. A  /  x ]. y  e.  B  ->  [. A  /  x ]. y  e.  C
)  <->  ( y  e. 
[_ A  /  x ]_ B  ->  y  e. 
[_ A  /  x ]_ C ) ) )
62, 5bitrd 188 . . . 4  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) ) )
76albidv 1872 . . 3  |-  ( A  e.  V  ->  ( A. y [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <->  A. y
( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) ) )
81, 7bitrd 188 . 2  |-  ( A  e.  V  ->  ( [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C )  <->  A. y
( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) ) )
9 ssalel 3215 . . 3  |-  ( B 
C_  C  <->  A. y
( y  e.  B  ->  y  e.  C ) )
109sbcbii 3091 . 2  |-  ( [. A  /  x ]. B  C_  C  <->  [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C ) )
11 ssalel 3215 . 2  |-  ( [_ A  /  x ]_ B  C_ 
[_ A  /  x ]_ C  <->  A. y ( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) )
128, 10, 113bitr4g 223 1  |-  ( A  e.  V  ->  ( [. A  /  x ]. B  C_  C  <->  [_ A  /  x ]_ B  C_  [_ A  /  x ]_ C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1395    e. wcel 2202   [.wsbc 3031   [_csb 3127    C_ wss 3200
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-sbc 3032  df-csb 3128  df-in 3206  df-ss 3213
This theorem is referenced by:  sbcrel  4812  sbcfg  5481
  Copyright terms: Public domain W3C validator