MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  weth Structured version   Visualization version   GIF version

Theorem weth 10583
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.)
Assertion
Ref Expression
weth (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 We 𝐴)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem weth
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 weeq2 5642 . . 3 (𝑦 = 𝐴 → (𝑥 We 𝑦 ↔ 𝑥 We 𝐴))
21exbidv 1955 . 2 (𝑦 = 𝐴 → (∃𝑥 𝑥 We 𝑦 ↔ ∃𝑥 𝑥 We 𝐴))
3 dfac8 10224 . . 3 (CHOICE ↔ ∀𝑦∃𝑥 𝑥 We 𝑦)
43axaci 10556 . 2 ∃𝑥 𝑥 We 𝑦
52, 4vtoclg 3520 1 (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 We 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569  ∃wex 1811   ∈ wcel 2146   We wwe 5606
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-ac2 10551
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-se 5608  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6310  df-ord 6371  df-on 6372  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-isom 6555  df-riota 7384  df-ov 7430  df-2nd 8009  df-frecs 8310  df-wrecs 8341  df-recs 8390  df-en 8985  df-card 10030  df-ac 10205
This theorem is used by:  vitali2  47843
  Copyright terms: Public domain W3C validator