![]() |
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 5132 | . . 3 ⊢ (𝑦 = 𝐴 → (𝑥 We 𝑦 ↔ 𝑥 We 𝐴)) | |
2 | 1 | exbidv 1890 | . 2 ⊢ (𝑦 = 𝐴 → (∃𝑥 𝑥 We 𝑦 ↔ ∃𝑥 𝑥 We 𝐴)) |
3 | dfac8 8995 | . . 3 ⊢ (CHOICE ↔ ∀𝑦∃𝑥 𝑥 We 𝑦) | |
4 | 3 | axaci 9328 | . 2 ⊢ ∃𝑥 𝑥 We 𝑦 |
5 | 2, 4 | vtoclg 3297 | 1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 We 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1523 ∃wex 1744 ∈ wcel 2030 We wwe 5101 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-ac2 9323 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-se 5103 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-isom 5935 df-riota 6651 df-wrecs 7452 df-recs 7513 df-en 7998 df-card 8803 df-ac 8977 |
This theorem is referenced by: vitali2 41229 |
Copyright terms: Public domain | W3C validator |