Metamath Proof Explorer


Theorem intmin2

Description: Any set is the smallest of all sets that include it. (Contributed by NM, 20-Sep-2003)

Ref Expression
Hypothesis intmin2.1 A V
Assertion intmin2 x | A x = A

Proof

Step Hyp Ref Expression
1 intmin2.1 A V
2 rabab x V | A x = x | A x
3 2 inteqi x V | A x = x | A x
4 intmin A V x V | A x = A
5 1 4 ax-mp x V | A x = A
6 3 5 eqtr3i x | A x = A