Theorem weth 4759

Description: Well-ordering theorem: any set A can be well-ordered. This is an equivalent of the Axiom of Choice. Theorem 6 of [Suppes] p. 242. First proved by Ernst Zermelo (the "Z" in ZFC) in 1904.

Hypothesis

Ref	Expression
weth.1	⊢ A ∈ V

Assertion

Ref	Expression
weth	⊢ ∃x x We A

Distinct variable group:   x,A

Proof of Theorem weth

Step	Hyp	Ref	Expression
1		weth.1	. . 3 ⊢ A ∈ V
2	1	numth 4756	. 2 ⊢ ∃y ∈ On ∃f f:y–1-1-onto→A
3		f1ocnv 3686	. . . . . 6 ⊢ (f:y–1-1-onto→A → ◡f:A–1-1-onto→y)
4		eqid 1468	. . . . . . . . 9 ⊢ {⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} = {⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)}
5	4	f1owe 3890	. . . . . . . 8 ⊢ (◡f:A–1-1-onto→y → (E We y → {⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} We A))
6		weinxp 3223	. . . . . . . . 9 ⊢ ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} We A ↔ ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} ∩ (A × A)) We A)
7	1, 1	xpex 3250	. . . . . . . . . . 11 ⊢ (A × A) ∈ V
8	7	inex2 2707	. . . . . . . . . 10 ⊢ ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} ∩ (A × A)) ∈ V
9		weeq1 2927	. . . . . . . . . 10 ⊢ (x = ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} ∩ (A × A)) → (x We A ↔ ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} ∩ (A × A)) We A))
10	8, 9	cla4ev 1860	. . . . . . . . 9 ⊢ (({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} ∩ (A × A)) We A → ∃x x We A)
11	6, 10	sylbi 199	. . . . . . . 8 ⊢ ({⟨z, w⟩∣(◡f ‘z)E(◡f ‘w)} We A → ∃x x We A)
12	5, 11	syl6 22	. . . . . . 7 ⊢ (◡f:A–1-1-onto→y → (E We y → ∃x x We A))
13		eloni 2948	. . . . . . . 8 ⊢ (y ∈ On → Ord y)
14		ordwe 2951	. . . . . . . 8 ⊢ (Ord y → E We y)
15	13, 14	syl 10	. . . . . . 7 ⊢ (y ∈ On → E We y)
16	12, 15	syl5 21	. . . . . 6 ⊢ (◡f:A–1-1-onto→y → (y ∈ On → ∃x x We A))
17	3, 16	syl 10	. . . . 5 ⊢ (f:y–1-1-onto→A → (y ∈ On → ∃x x We A))
18	17	19.23aiv 1290	. . . 4 ⊢ (∃f f:y–1-1-onto→A → (y ∈ On → ∃x x We A))
19	18	com12 11	. . 3 ⊢ (y ∈ On → (∃f f:y–1-1-onto→A → ∃x x We A))
20	19	r19.23aiv 1735	. 2 ⊢ (∃y ∈ On ∃f f:y–1-1-onto→A → ∃x x We A)
21	2, 20	ax-mp 7	1 ⊢ ∃x x We A

Syntax hints:   → wi 3   ∈ wcel 955  ∃wex 977  ∃wrex 1638  Vcvv 1802   ∩ cin 2036   class class class wbr 2609  {copab 2656  Ecep 2819   We wwe 2906  Ord word 2937  Oncon0 2938   × cxp 3158  ^◡ccnv 3159  –1-1-onto→wf1o 3171   ‘cfv 3172

This theorem is referenced by:  zorn2lem7 4766  acdc3 7429  acdc2 7432  acdc5 7435  acdc 7437

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857  ax-ac 4716

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-reu 1643  df-rab 1644  df-v 1803  df-sbc 1932  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-int 2524  df-iun 2558  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-id 2824  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-suc 2944  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-fun 3182  df-fn 3183  df-f 3184  df-f1 3185  df-fo 3186  df-f1o 3187  df-fv 3188  df-iso 3189

Copyright terms: Public domain