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

Theorem sbcssg 3477
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 2965 . . 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 2954 . . . . 5  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( [. A  /  x ]. y  e.  B  ->  [. A  /  x ]. y  e.  C
) ) )
3 sbcel2g 3028 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  B  <->  y  e.  [_ A  /  x ]_ B ) )
4 sbcel2g 3028 . . . . . 6  |-  ( A  e.  V  ->  ( [. A  /  x ]. y  e.  C  <->  y  e.  [_ A  /  x ]_ C ) )
53, 4imbi12d 233 . . . . 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 187 . . . 4  |-  ( A  e.  V  ->  ( [. A  /  x ]. ( y  e.  B  ->  y  e.  C )  <-> 
( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) ) )
76albidv 1797 . . 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 187 . 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 3091 . . 3  |-  ( B 
C_  C  <->  A. y
( y  e.  B  ->  y  e.  C ) )
109sbcbii 2972 . 2  |-  ( [. A  /  x ]. B  C_  C  <->  [. A  /  x ]. A. y ( y  e.  B  ->  y  e.  C ) )
11 dfss2 3091 . 2  |-  ( [_ A  /  x ]_ B  C_ 
[_ A  /  x ]_ C  <->  A. y ( y  e.  [_ A  /  x ]_ B  ->  y  e.  [_ A  /  x ]_ C ) )
128, 10, 113bitr4g 222 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 104   A.wal 1330    e. wcel 1481   [.wsbc 2913   [_csb 3007    C_ wss 3076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-sbc 2914  df-csb 3008  df-in 3082  df-ss 3089
This theorem is referenced by:  sbcrel  4633  sbcfg  5279
  Copyright terms: Public domain W3C validator