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

Theorem intmin3 4013
Description: Under subset ordering, the intersection of a class abstraction is less than or equal to any of its members. (Contributed by NM, 3-Jul-2005.)
Hypotheses
Ref Expression
intmin3.2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
intmin3.3  |-  ps
Assertion
Ref Expression
intmin3  |-  ( A  e.  V  ->  |^| { x  |  ph }  C_  A
)
Distinct variable groups:    x, A    ps, x
Allowed substitution hints:    ph( x)    V( x)

Proof of Theorem intmin3
StepHypRef Expression
1 intmin3.3 . . 3  |-  ps
2 intmin3.2 . . . 4  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
32elabg 3019 . . 3  |-  ( A  e.  V  ->  ( A  e.  { x  |  ph }  <->  ps )
)
41, 3mpbiri 225 . 2  |-  ( A  e.  V  ->  A  e.  { x  |  ph } )
5 intss1 4000 . 2  |-  ( A  e.  { x  | 
ph }  ->  |^| { x  |  ph }  C_  A
)
64, 5syl 16 1  |-  ( A  e.  V  ->  |^| { x  |  ph }  C_  A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    = wceq 1649    e. wcel 1717   {cab 2366    C_ wss 3256   |^|cint 3985
This theorem is referenced by:  intabs  4295  intid  4355
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-v 2894  df-in 3263  df-ss 3270  df-int 3986
  Copyright terms: Public domain W3C validator