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

Theorem sbcssg 3568
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 3050 . . 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 3039 . . . . 5  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( [. A  /  x ]. y  e.  B  ->  [. A  /  x ]. y  e.  C
) ) )
3 sbcel2g 3113 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  B  <->  y  e.  [_ A  /  x ]_ B ) )
4 sbcel2g 3113 . . . . . 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 1846 . . 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 3180 . . 3  |-  ( B 
C_  C  <->  A. y
( y  e.  B  ->  y  e.  C ) )
109sbcbii 3057 . 2  |-  ( [. A  /  x ]. B  C_  C  <->  [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C ) )
11 ssalel 3180 . 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 1370    e. wcel 2175   [.wsbc 2997   [_csb 3092    C_ wss 3165
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186
This theorem depends on definitions:  df-bi 117  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-v 2773  df-sbc 2998  df-csb 3093  df-in 3171  df-ss 3178
This theorem is referenced by:  sbcrel  4759  sbcfg  5418
  Copyright terms: Public domain W3C validator