Theorem intmin3 4505

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

Step	Hyp	Ref	Expression
1		intmin3.3	. . 3 |- ps
2		intmin3.2	. . . 4 |- ( x = A -> ( ph <-> ps ) )
3	2	elabg 3351	. . 3 |- ( A e. V -> ( A e. { x | ph } <-> ps ) )
4	1, 3	mpbiri 248	. 2 |- ( A e. V -> A e. { x | ph } )
5		intss1 4492	. 2 |- ( A e. { x | ph } -> |^| { x | ph } C_ A )
6	4, 5	syl 17	1 |- ( A e. V -> |^| { x | ph } C_ A )

Syntax hints:   -> wi 4   <-> wb 196   = wceq 1483   e. wcel 1990   {cab 2608   C_ wss 3574   |^|cint 4475

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-in 3581  df-ss 3588  df-int 4476

This theorem is referenced by:  intabs  4825  intid  4926