Theorem intminss 3869

Description: Under subset ordering, the intersection of a restricted class abstraction is less than or equal to any of its members. (Contributed by NM, 7-Sep-2013.)

Hypothesis

Ref	Expression
intminss.1	|- ( x = A -> ( ph <-> ps ) )

Assertion

Ref	Expression
intminss	|- ( ( A e. B /\ ps ) -> |^| { x e. B | ph } C_ A )

Distinct variable groups:   x, A   x, B   ps, x

Allowed substitution hint:   ph( x)

Proof of Theorem intminss

Step	Hyp	Ref	Expression
1		intminss.1	. . 3 |- ( x = A -> ( ph <-> ps ) )
2	1	elrab 2893	. 2 |- ( A e. { x e. B | ph } <-> ( A e. B /\ ps ) )
3		intss1 3859	. 2 |- ( A e. { x e. B | ph } -> |^| { x e. B | ph } C_ A )
4	2, 3	sylbir 135	1 |- ( ( A e. B /\ ps ) -> |^| { x e. B | ph } C_ A )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   {crab 2459   C_ wss 3129   |^|cint 3844

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rab 2464  df-v 2739  df-in 3135  df-ss 3142  df-int 3845

This theorem is referenced by:  onintss  4389  cardonle  7183