Metamath Proof Explorer


Theorem kardex

Description: The collection of all sets equinumerous to a set A and having the least possible rank is a set. This is the part of the justification of the definition of kard of Enderton p. 222. (Contributed by NM, 14-Dec-2003)

Ref Expression
Assertion kardex x|xAyyArankxrankyV

Proof

Step Hyp Ref Expression
1 df-rab xz|zA|yz|zArankxranky=x|xz|zAyz|zArankxranky
2 vex xV
3 breq1 z=xzAxA
4 2 3 elab xz|zAxA
5 breq1 z=yzAyA
6 5 ralab yz|zArankxrankyyyArankxranky
7 4 6 anbi12i xz|zAyz|zArankxrankyxAyyArankxranky
8 7 abbii x|xz|zAyz|zArankxranky=x|xAyyArankxranky
9 1 8 eqtri xz|zA|yz|zArankxranky=x|xAyyArankxranky
10 scottex xz|zA|yz|zArankxrankyV
11 9 10 eqeltrri x|xAyyArankxrankyV