MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  intmin Unicode version

Theorem intmin 3882
Description: Any member of a class is the smallest of those members that include it. (Contributed by NM, 13-Aug-2002.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
intmin  |-  ( A  e.  B  ->  |^| { x  e.  B  |  A  C_  x }  =  A )
Distinct variable groups:    x, A    x, B

Proof of Theorem intmin
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 vex 2791 . . . . 5  |-  y  e. 
_V
21elintrab 3874 . . . 4  |-  ( y  e.  |^| { x  e.  B  |  A  C_  x }  <->  A. x  e.  B  ( A  C_  x  -> 
y  e.  x ) )
3 ssid 3197 . . . . 5  |-  A  C_  A
4 sseq2 3200 . . . . . . 7  |-  ( x  =  A  ->  ( A  C_  x  <->  A  C_  A
) )
5 eleq2 2344 . . . . . . 7  |-  ( x  =  A  ->  (
y  e.  x  <->  y  e.  A ) )
64, 5imbi12d 311 . . . . . 6  |-  ( x  =  A  ->  (
( A  C_  x  ->  y  e.  x )  <-> 
( A  C_  A  ->  y  e.  A ) ) )
76rspcv 2880 . . . . 5  |-  ( A  e.  B  ->  ( A. x  e.  B  ( A  C_  x  -> 
y  e.  x )  ->  ( A  C_  A  ->  y  e.  A
) ) )
83, 7mpii 39 . . . 4  |-  ( A  e.  B  ->  ( A. x  e.  B  ( A  C_  x  -> 
y  e.  x )  ->  y  e.  A
) )
92, 8syl5bi 208 . . 3  |-  ( A  e.  B  ->  (
y  e.  |^| { x  e.  B  |  A  C_  x }  ->  y  e.  A ) )
109ssrdv 3185 . 2  |-  ( A  e.  B  ->  |^| { x  e.  B  |  A  C_  x }  C_  A
)
11 ssintub 3880 . . 3  |-  A  C_  |^|
{ x  e.  B  |  A  C_  x }
1211a1i 10 . 2  |-  ( A  e.  B  ->  A  C_ 
|^| { x  e.  B  |  A  C_  x }
)
1310, 12eqssd 3196 1  |-  ( A  e.  B  ->  |^| { x  e.  B  |  A  C_  x }  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1623    e. wcel 1684   A.wral 2543   {crab 2547    C_ wss 3152   |^|cint 3862
This theorem is referenced by:  intmin2  3889  ordintdif  4441  bm2.5ii  4597  onsucmin  4612  rankonidlem  7500  rankval4  7539  mrcid  13515  lspid  15739  aspid  16070  cldcls  16779  spanid  21926  chsupid  21991  igenidl2  26690  pclidN  30085  diaocN  31315
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ral 2548  df-rab 2552  df-v 2790  df-in 3159  df-ss 3166  df-int 3863
  Copyright terms: Public domain W3C validator