Metamath Proof Explorer


Theorem ac10ct

Description: A proof of the well-ordering theorem weth , an Axiom of Choice equivalent, restricted to sets dominated by some ordinal (in particular finite sets and countable sets), proven in ZF without AC. (Contributed by Mario Carneiro, 5-Jan-2013)

Ref Expression
Assertion ac10ct y On A y x x We A

Proof

Step Hyp Ref Expression
1 vex y V
2 1 brdom A y f f : A 1-1 y
3 onss y On y On
4 3 a1i f : A 1-1 y y On y On
5 epweon E We On
6 wess y On E We On E We y
7 4 5 6 syl6mpi f : A 1-1 y y On E We y
8 7 adantl A y f : A 1-1 y y On E We y
9 eqid w z | f w E f z = w z | f w E f z
10 9 f1we f : A 1-1 y E We y w z | f w E f z We A
11 weinxp w z | f w E f z We A w z | f w E f z A × A We A
12 reldom Rel
13 12 brrelex1i A y A V
14 sqxpexg A V A × A V
15 inex2g A × A V w z | f w E f z A × A V
16 weeq1 x = w z | f w E f z A × A x We A w z | f w E f z A × A We A
17 16 spcegv w z | f w E f z A × A V w z | f w E f z A × A We A x x We A
18 13 14 15 17 4syl A y w z | f w E f z A × A We A x x We A
19 11 18 biimtrid A y w z | f w E f z We A x x We A
20 10 19 sylan9r A y f : A 1-1 y E We y x x We A
21 8 20 syld A y f : A 1-1 y y On x x We A
22 21 impancom A y y On f : A 1-1 y x x We A
23 22 exlimdv A y y On f f : A 1-1 y x x We A
24 2 23 biimtrid A y y On A y x x We A
25 24 ex A y y On A y x x We A
26 25 pm2.43b y On A y x x We A
27 26 rexlimiv y On A y x x We A