Metamath Proof Explorer


Theorem cardeqv

Description: All sets are well-orderable under choice. (Contributed by Mario Carneiro, 28-Apr-2015)

Ref Expression
Assertion cardeqv domcard=V

Proof

Step Hyp Ref Expression
1 axac3 CHOICE
2 dfac10 CHOICEdomcard=V
3 1 2 mpbi domcard=V