Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brsset Structured version   Unicode version

Theorem brsset 28966
Description: For sets, the  SSet binary relationship is equivalent to the subset relationship. (Contributed by Scott Fenton, 31-Mar-2012.)
Hypothesis
Ref Expression
brsset.1  |-  B  e. 
_V
Assertion
Ref Expression
brsset  |-  ( A
SSet B  <->  A  C_  B )

Proof of Theorem brsset
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relsset 28965 . . 3  |-  Rel  SSet
21brrelexi 5032 . 2  |-  ( A
SSet B  ->  A  e. 
_V )
3 brsset.1 . . 3  |-  B  e. 
_V
43ssex 4584 . 2  |-  ( A 
C_  B  ->  A  e.  _V )
5 breq1 4443 . . 3  |-  ( x  =  A  ->  (
x SSet B  <->  A SSet B ) )
6 sseq1 3518 . . 3  |-  ( x  =  A  ->  (
x  C_  B  <->  A  C_  B
) )
7 opex 4704 . . . . . . 7  |-  <. x ,  B >.  e.  _V
87elrn 5234 . . . . . 6  |-  ( <.
x ,  B >.  e. 
ran  (  _E  (x)  ( _V  \  _E  )
)  <->  E. y  y (  _E  (x)  ( _V  \  _E  ) ) <.
x ,  B >. )
9 vex 3109 . . . . . . . . 9  |-  y  e. 
_V
10 vex 3109 . . . . . . . . 9  |-  x  e. 
_V
119, 10, 3brtxp 28957 . . . . . . . 8  |-  ( y (  _E  (x)  ( _V  \  _E  ) )
<. x ,  B >.  <->  (
y  _E  x  /\  y ( _V  \  _E  ) B ) )
12 epel 4787 . . . . . . . . 9  |-  ( y  _E  x  <->  y  e.  x )
13 brv 28954 . . . . . . . . . . 11  |-  y _V B
14 brdif 4490 . . . . . . . . . . 11  |-  ( y ( _V  \  _E  ) B  <->  ( y _V B  /\  -.  y  _E  B ) )
1513, 14mpbiran 911 . . . . . . . . . 10  |-  ( y ( _V  \  _E  ) B  <->  -.  y  _E  B )
163epelc 4786 . . . . . . . . . 10  |-  ( y  _E  B  <->  y  e.  B )
1715, 16xchbinx 310 . . . . . . . . 9  |-  ( y ( _V  \  _E  ) B  <->  -.  y  e.  B )
1812, 17anbi12i 697 . . . . . . . 8  |-  ( ( y  _E  x  /\  y ( _V  \  _E  ) B )  <->  ( y  e.  x  /\  -.  y  e.  B ) )
1911, 18bitri 249 . . . . . . 7  |-  ( y (  _E  (x)  ( _V  \  _E  ) )
<. x ,  B >.  <->  (
y  e.  x  /\  -.  y  e.  B
) )
2019exbii 1639 . . . . . 6  |-  ( E. y  y (  _E 
(x)  ( _V  \  _E  ) ) <. x ,  B >.  <->  E. y ( y  e.  x  /\  -.  y  e.  B )
)
21 exanali 1642 . . . . . 6  |-  ( E. y ( y  e.  x  /\  -.  y  e.  B )  <->  -.  A. y
( y  e.  x  ->  y  e.  B ) )
228, 20, 213bitrri 272 . . . . 5  |-  ( -. 
A. y ( y  e.  x  ->  y  e.  B )  <->  <. x ,  B >.  e.  ran  (  _E  (x)  ( _V 
\  _E  ) ) )
2322con1bii 331 . . . 4  |-  ( -. 
<. x ,  B >.  e. 
ran  (  _E  (x)  ( _V  \  _E  )
)  <->  A. y ( y  e.  x  ->  y  e.  B ) )
24 df-br 4441 . . . . 5  |-  ( x
SSet B  <->  <. x ,  B >.  e.  SSet )
25 df-sset 28932 . . . . . . 7  |-  SSet  =  ( ( _V  X.  _V )  \  ran  (  _E  (x)  ( _V  \  _E  ) ) )
2625eleq2i 2538 . . . . . 6  |-  ( <.
x ,  B >.  e. 
SSet 
<-> 
<. x ,  B >.  e.  ( ( _V  X.  _V )  \  ran  (  _E  (x)  ( _V  \  _E  ) ) ) )
2710, 3opelvv 5038 . . . . . . 7  |-  <. x ,  B >.  e.  ( _V  X.  _V )
28 eldif 3479 . . . . . . 7  |-  ( <.
x ,  B >.  e.  ( ( _V  X.  _V )  \  ran  (  _E  (x)  ( _V  \  _E  ) ) )  <->  ( <. x ,  B >.  e.  ( _V  X.  _V )  /\  -.  <. x ,  B >.  e.  ran  (  _E 
(x)  ( _V  \  _E  ) ) ) )
2927, 28mpbiran 911 . . . . . 6  |-  ( <.
x ,  B >.  e.  ( ( _V  X.  _V )  \  ran  (  _E  (x)  ( _V  \  _E  ) ) )  <->  -.  <. x ,  B >.  e.  ran  (  _E  (x)  ( _V 
\  _E  ) ) )
3026, 29bitri 249 . . . . 5  |-  ( <.
x ,  B >.  e. 
SSet 
<->  -.  <. x ,  B >.  e.  ran  (  _E 
(x)  ( _V  \  _E  ) ) )
3124, 30bitri 249 . . . 4  |-  ( x
SSet B  <->  -.  <. x ,  B >.  e.  ran  (  _E  (x)  ( _V 
\  _E  ) ) )
32 dfss2 3486 . . . 4  |-  ( x 
C_  B  <->  A. y
( y  e.  x  ->  y  e.  B ) )
3323, 31, 323bitr4i 277 . . 3  |-  ( x
SSet B  <->  x  C_  B )
345, 6, 33vtoclbg 3165 . 2  |-  ( A  e.  _V  ->  ( A SSet B  <->  A  C_  B
) )
352, 4, 34pm5.21nii 353 1  |-  ( A
SSet B  <->  A  C_  B )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369   A.wal 1372   E.wex 1591    e. wcel 1762   _Vcvv 3106    \ cdif 3466    C_ wss 3469   <.cop 4026   class class class wbr 4440    _E cep 4782    X. cxp 4990   ran crn 4993    (x) ctxp 28906   SSetcsset 28908
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-mpt 4500  df-eprel 4784  df-id 4788  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-iota 5542  df-fun 5581  df-fn 5582  df-f 5583  df-fo 5585  df-fv 5587  df-1st 6774  df-2nd 6775  df-txp 28930  df-sset 28932
This theorem is referenced by:  idsset  28967  dfon3  28969  imagesset  29030
  Copyright terms: Public domain W3C validator