Metamath Proof Explorer


Theorem intminss

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)

Ref Expression
Hypothesis intminss.1 x=Aφψ
Assertion intminss ABψxB|φA

Proof

Step Hyp Ref Expression
1 intminss.1 x=Aφψ
2 1 elrab AxB|φABψ
3 intss1 AxB|φxB|φA
4 2 3 sylbir ABψxB|φA