Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > weth | Structured version Visualization version GIF version |
Description: Well-ordering theorem: any set 𝐴 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. (Contributed by Mario Carneiro, 5-Jan-2013.) |
Ref | Expression |
---|---|
weth | ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 We 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | weeq2 5543 | . . 3 ⊢ (𝑦 = 𝐴 → (𝑥 We 𝑦 ↔ 𝑥 We 𝐴)) | |
2 | 1 | exbidv 1918 | . 2 ⊢ (𝑦 = 𝐴 → (∃𝑥 𝑥 We 𝑦 ↔ ∃𝑥 𝑥 We 𝐴)) |
3 | dfac8 9560 | . . 3 ⊢ (CHOICE ↔ ∀𝑦∃𝑥 𝑥 We 𝑦) | |
4 | 3 | axaci 9889 | . 2 ⊢ ∃𝑥 𝑥 We 𝑦 |
5 | 2, 4 | vtoclg 3567 | 1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 We 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∃wex 1776 ∈ wcel 2110 We wwe 5512 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-ac2 9884 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-se 5514 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-isom 6363 df-riota 7113 df-wrecs 7946 df-recs 8007 df-en 8509 df-card 9367 df-ac 9541 |
This theorem is referenced by: vitali2 42975 |
Copyright terms: Public domain | W3C validator |