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

Theorem sbcssg 3530
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 3013 . . 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 3002 . . . . 5  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( [. A  /  x ]. y  e.  B  ->  [. A  /  x ]. y  e.  C
) ) )
3 sbcel2g 3076 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  B  <->  y  e.  [_ A  /  x ]_ B ) )
4 sbcel2g 3076 . . . . . 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 1822 . . 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 dfss2 3142 . . 3  |-  ( B 
C_  C  <->  A. y
( y  e.  B  ->  y  e.  C ) )
109sbcbii 3020 . 2  |-  ( [. A  /  x ]. B  C_  C  <->  [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C ) )
11 dfss2 3142 . 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 1351    e. wcel 2146   [.wsbc 2960   [_csb 3055    C_ wss 3127
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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-sbc 2961  df-csb 3056  df-in 3133  df-ss 3140
This theorem is referenced by:  sbcrel  4706  sbcfg  5356
  Copyright terms: Public domain W3C validator