Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfac8 | Structured version Visualization version GIF version |
Description: A proof of the equivalency of the well-ordering theorem weth 9916 and the axiom of choice ac7 9894. (Contributed by Mario Carneiro, 5-Jan-2013.) |
Ref | Expression |
---|---|
dfac8 | ⊢ (CHOICE ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfac3 9546 | . 2 ⊢ (CHOICE ↔ ∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) | |
2 | vex 3497 | . . . . . 6 ⊢ 𝑥 ∈ V | |
3 | vpwex 5277 | . . . . . . 7 ⊢ 𝒫 𝑥 ∈ V | |
4 | raleq 3405 | . . . . . . . 8 ⊢ (𝑦 = 𝒫 𝑥 → (∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) | |
5 | 4 | exbidv 1918 | . . . . . . 7 ⊢ (𝑦 = 𝒫 𝑥 → (∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) |
6 | 3, 5 | spcv 3605 | . . . . . 6 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
7 | dfac8a 9455 | . . . . . 6 ⊢ (𝑥 ∈ V → (∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → 𝑥 ∈ dom card)) | |
8 | 2, 6, 7 | mpsyl 68 | . . . . 5 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → 𝑥 ∈ dom card) |
9 | dfac8b 9456 | . . . . 5 ⊢ (𝑥 ∈ dom card → ∃𝑟 𝑟 We 𝑥) | |
10 | 8, 9 | syl 17 | . . . 4 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑟 𝑟 We 𝑥) |
11 | 10 | alrimiv 1924 | . . 3 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∀𝑥∃𝑟 𝑟 We 𝑥) |
12 | vex 3497 | . . . . 5 ⊢ 𝑦 ∈ V | |
13 | vuniex 7464 | . . . . . 6 ⊢ ∪ 𝑦 ∈ V | |
14 | weeq2 5543 | . . . . . . 7 ⊢ (𝑥 = ∪ 𝑦 → (𝑟 We 𝑥 ↔ 𝑟 We ∪ 𝑦)) | |
15 | 14 | exbidv 1918 | . . . . . 6 ⊢ (𝑥 = ∪ 𝑦 → (∃𝑟 𝑟 We 𝑥 ↔ ∃𝑟 𝑟 We ∪ 𝑦)) |
16 | 13, 15 | spcv 3605 | . . . . 5 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∃𝑟 𝑟 We ∪ 𝑦) |
17 | dfac8c 9458 | . . . . 5 ⊢ (𝑦 ∈ V → (∃𝑟 𝑟 We ∪ 𝑦 → ∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) | |
18 | 12, 16, 17 | mpsyl 68 | . . . 4 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
19 | 18 | alrimiv 1924 | . . 3 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
20 | 11, 19 | impbii 211 | . 2 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
21 | 1, 20 | bitri 277 | 1 ⊢ (CHOICE ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1531 = wceq 1533 ∃wex 1776 ∈ wcel 2110 ≠ wne 3016 ∀wral 3138 Vcvv 3494 ∅c0 4290 𝒫 cpw 4538 ∪ cuni 4837 We wwe 5512 dom cdm 5554 ‘cfv 6354 cardccrd 9363 CHOICEwac 9540 |
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 |
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: dfac10 9562 weth 9916 dfac11 39660 |
Copyright terms: Public domain | W3C validator |