Metamath Proof Explorer


Theorem dfac8b

Description: The well-ordering theorem: every numerable set is well-orderable. (Contributed by Mario Carneiro, 5-Jan-2013) (Revised by Mario Carneiro, 29-Apr-2015)

Ref Expression
Assertion dfac8b A dom card x x We A

Proof

Step Hyp Ref Expression
1 cardid2 A dom card card A A
2 bren card A A f f : card A 1-1 onto A
3 1 2 sylib A dom card f f : card A 1-1 onto A
4 sqxpexg A dom card A × A V
5 inex2g A × A V z w | f -1 z E f -1 w A × A V
6 4 5 syl A dom card z w | f -1 z E f -1 w A × A V
7 f1ocnv f : card A 1-1 onto A f -1 : A 1-1 onto card A
8 cardon card A On
9 8 onordi Ord card A
10 ordwe Ord card A E We card A
11 9 10 ax-mp E We card A
12 eqid z w | f -1 z E f -1 w = z w | f -1 z E f -1 w
13 12 f1owe f -1 : A 1-1 onto card A z w | f -1 z E f -1 w We A E We card A
14 11 13 mpbiri f -1 : A 1-1 onto card A z w | f -1 z E f -1 w We A
15 7 14 syl f : card A 1-1 onto A z w | f -1 z E f -1 w We A
16 weinxp z w | f -1 z E f -1 w We A z w | f -1 z E f -1 w A × A We A
17 15 16 sylib f : card A 1-1 onto A z w | f -1 z E f -1 w A × A We A
18 weeq1 x = z w | f -1 z E f -1 w A × A x We A z w | f -1 z E f -1 w A × A We A
19 18 spcegv z w | f -1 z E f -1 w A × A V z w | f -1 z E f -1 w A × A We A x x We A
20 6 17 19 syl2im A dom card f : card A 1-1 onto A x x We A
21 20 exlimdv A dom card f f : card A 1-1 onto A x x We A
22 3 21 mpd A dom card x x We A