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

Theorem ssintub 3941
Description: Subclass of the least upper bound. (Contributed by NM, 8-Aug-2000.)
Assertion
Ref Expression
ssintub  |-  A  C_  |^|
{ x  e.  B  |  A  C_  x }
Distinct variable groups:    x, A    x, B

Proof of Theorem ssintub
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ssint 3939 . 2  |-  ( A 
C_  |^| { x  e.  B  |  A  C_  x }  <->  A. y  e.  {
x  e.  B  |  A  C_  x } A  C_  y )
2 sseq2 3248 . . . 4  |-  ( x  =  y  ->  ( A  C_  x  <->  A  C_  y
) )
32elrab 2959 . . 3  |-  ( y  e.  { x  e.  B  |  A  C_  x }  <->  ( y  e.  B  /\  A  C_  y ) )
43simprbi 275 . 2  |-  ( y  e.  { x  e.  B  |  A  C_  x }  ->  A  C_  y )
51, 4mprgbir 2588 1  |-  A  C_  |^|
{ x  e.  B  |  A  C_  x }
Colors of variables: wff set class
Syntax hints:    e. wcel 2200   {crab 2512    C_ wss 3197   |^|cint 3923
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rab 2517  df-v 2801  df-in 3203  df-ss 3210  df-int 3924
This theorem is referenced by:  intmin  3943  lspssid  14364  sscls  14794
  Copyright terms: Public domain W3C validator