Metamath Proof Explorer

Theorem karden

Description: If we allow the Axiom of Regularity, we can avoid the Axiom of Choice by defining the cardinal number of a set as the set of all sets equinumerous to it and having the least possible rank. This theorem proves the equinumerosity relationship for this definition (compare carden ). The hypotheses correspond to the definition of kard of Enderton p. 222 (which we don't define separately since currently we do not use it elsewhere). This theorem along with kardex justify the definition of kard. The restriction to the least rank prevents the proper class that would result from { x | x ~A } . (Contributed by NM, 18-Dec-2003) (Revised by AV, 12-Jul-2022) Use the Scott operation. (Revised by BTernaryTau, 19-Jul-2026)

Ref Expression
Hypotheses karden.a 
|- A e. _V
karden.c 
|- C = Scott { x | x ~~ A }
karden.d 
|- D = Scott { x | x ~~ B }
Assertion karden 
|- ( C = D <-> A ~~ B )

Proof

Step Hyp Ref Expression
1 karden.a 
 |-  A e. _V
2 karden.c 
 |-  C = Scott { x | x ~~ A }
3 karden.d 
 |-  D = Scott { x | x ~~ B }
4 breq1 
 |-  ( x = A -> ( x ~~ A <-> A ~~ A ) )
5 1 enref 
 |-  A ~~ A
6 1 4 5 ceqsexv2d 
 |-  E. x x ~~ A
7 2 neeq1i 
 |-  ( C =/= (/) <-> Scott { x | x ~~ A } =/= (/) )
8 scott0b 
 |-  ( { x | x ~~ A } = (/) <-> Scott { x | x ~~ A } = (/) )
9 8 necon3bii 
 |-  ( { x | x ~~ A } =/= (/) <-> Scott { x | x ~~ A } =/= (/) )
10 abn0 
 |-  ( { x | x ~~ A } =/= (/) <-> E. x x ~~ A )
11 7 9 10 3bitr2i 
 |-  ( C =/= (/) <-> E. x x ~~ A )
12 6 11 mpbir 
 |-  C =/= (/)
13 n0 
 |-  ( C =/= (/) <-> E. y y e. C )
14 12 13 mpbi 
 |-  E. y y e. C
15 eleq2 
 |-  ( C = D -> ( y e. C <-> y e. D ) )
16 15 pm4.71da 
 |-  ( C = D -> ( y e. C <-> ( y e. C /\ y e. D ) ) )
17 breq1 
 |-  ( x = y -> ( x ~~ A <-> y ~~ A ) )
18 17 elscottab 
 |-  ( y e. Scott { x | x ~~ A } -> y ~~ A )
19 18 2 eleq2s 
 |-  ( y e. C -> y ~~ A )
20 19 ensymd 
 |-  ( y e. C -> A ~~ y )
21 breq1 
 |-  ( x = y -> ( x ~~ B <-> y ~~ B ) )
22 21 elscottab 
 |-  ( y e. Scott { x | x ~~ B } -> y ~~ B )
23 22 3 eleq2s 
 |-  ( y e. D -> y ~~ B )
24 entr 
 |-  ( ( A ~~ y /\ y ~~ B ) -> A ~~ B )
25 20 23 24 syl2an 
 |-  ( ( y e. C /\ y e. D ) -> A ~~ B )
26 16 25 biimtrdi 
 |-  ( C = D -> ( y e. C -> A ~~ B ) )
27 26 exlimdv 
 |-  ( C = D -> ( E. y y e. C -> A ~~ B ) )
28 14 27 mpi 
 |-  ( C = D -> A ~~ B )
29 enen2 
 |-  ( A ~~ B -> ( x ~~ A <-> x ~~ B ) )
30 29 abbidv 
 |-  ( A ~~ B -> { x | x ~~ A } = { x | x ~~ B } )
31 30 scotteqd 
 |-  ( A ~~ B -> Scott { x | x ~~ A } = Scott { x | x ~~ B } )
32 31 2 3 3eqtr4g 
 |-  ( A ~~ B -> C = D )
33 28 32 impbii 
 |-  ( C = D <-> A ~~ B )