| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfac13 | Structured version Visualization version GIF version | ||
| Description: The axiom of choice holds iff every set has choice sequences as long as itself. (Contributed by Mario Carneiro, 3-Sep-2015.) |
| Ref | Expression |
|---|---|
| dfac13 | ⊢ (CHOICE ↔ ∀𝑥 𝑥 ∈ AC 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3458 | . . . 4 ⊢ 𝑥 ∈ V | |
| 2 | acacni 10258 | . . . . 5 ⊢ ((CHOICE ∧ 𝑥 ∈ V) → AC 𝑥 = V) | |
| 3 | 2 | elvd 3460 | . . . 4 ⊢ (CHOICE → AC 𝑥 = V) |
| 4 | 1, 3 | eleqtrrid 2871 | . . 3 ⊢ (CHOICE → 𝑥 ∈ AC 𝑥) |
| 5 | 4 | alrimiv 1962 | . 2 ⊢ (CHOICE → ∀𝑥 𝑥 ∈ AC 𝑥) |
| 6 | vpwex 5346 | . . . . . . . 8 ⊢ 𝒫 𝑧 ∈ V | |
| 7 | id 23 | . . . . . . . . 9 ⊢ (𝑥 = 𝒫 𝑧 → 𝑥 = 𝒫 𝑧) | |
| 8 | acneq 10161 | . . . . . . . . 9 ⊢ (𝑥 = 𝒫 𝑧 → AC 𝑥 = AC 𝒫 𝑧) | |
| 9 | 7, 8 | eleq12d 2858 | . . . . . . . 8 ⊢ (𝑥 = 𝒫 𝑧 → (𝑥 ∈ AC 𝑥 ↔ 𝒫 𝑧 ∈ AC 𝒫 𝑧)) |
| 10 | 6, 9 | spcv 3563 | . . . . . . 7 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → 𝒫 𝑧 ∈ AC 𝒫 𝑧) |
| 11 | vex 3458 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 12 | vex 3458 | . . . . . . . . . . 11 ⊢ 𝑧 ∈ V | |
| 13 | 12 | canth2 9187 | . . . . . . . . . 10 ⊢ 𝑧 ≺ 𝒫 𝑧 |
| 14 | sdomdom 9045 | . . . . . . . . . 10 ⊢ (𝑧 ≺ 𝒫 𝑧 → 𝑧 ≼ 𝒫 𝑧) | |
| 15 | acndom2 10172 | . . . . . . . . . 10 ⊢ (𝑧 ≼ 𝒫 𝑧 → (𝒫 𝑧 ∈ AC 𝒫 𝑧 → 𝑧 ∈ AC 𝒫 𝑧)) | |
| 16 | 13, 14, 15 | mp2b 10 | . . . . . . . . 9 ⊢ (𝒫 𝑧 ∈ AC 𝒫 𝑧 → 𝑧 ∈ AC 𝒫 𝑧) |
| 17 | acnnum 10170 | . . . . . . . . 9 ⊢ (𝑧 ∈ AC 𝒫 𝑧 ↔ 𝑧 ∈ dom card) | |
| 18 | 16, 17 | sylib 221 | . . . . . . . 8 ⊢ (𝒫 𝑧 ∈ AC 𝒫 𝑧 → 𝑧 ∈ dom card) |
| 19 | numacn 10167 | . . . . . . . 8 ⊢ (𝑦 ∈ V → (𝑧 ∈ dom card → 𝑧 ∈ AC 𝑦)) | |
| 20 | 11, 18, 19 | mpsyl 69 | . . . . . . 7 ⊢ (𝒫 𝑧 ∈ AC 𝒫 𝑧 → 𝑧 ∈ AC 𝑦) |
| 21 | 10, 20 | syl 18 | . . . . . 6 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → 𝑧 ∈ AC 𝑦) |
| 22 | 12 | a1i 11 | . . . . . 6 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → 𝑧 ∈ V) |
| 23 | 21, 22 | 2thd 268 | . . . . 5 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → (𝑧 ∈ AC 𝑦 ↔ 𝑧 ∈ V)) |
| 24 | 23 | eqrdv 2761 | . . . 4 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → AC 𝑦 = V) |
| 25 | 24 | alrimiv 1962 | . . 3 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → ∀𝑦AC 𝑦 = V) |
| 26 | dfacacn 10259 | . . 3 ⊢ (CHOICE ↔ ∀𝑦AC 𝑦 = V) | |
| 27 | 25, 26 | sylibr 237 | . 2 ⊢ (∀𝑥 𝑥 ∈ AC 𝑥 → CHOICE) |
| 28 | 5, 27 | impbii 212 | 1 ⊢ (CHOICE ↔ ∀𝑥 𝑥 ∈ AC 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2147 Vcvv 3454 𝒫 cpw 4560 class class class wbr 5108 dom cdm 5658 ≼ cdom 9009 ≺ csdm 9010 cardccrd 10053 AC wacn 10056 CHOICEwac 10233 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-acn 10060 df-ac 10234 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |