| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfac12a | Structured version Visualization version GIF version | ||
| Description: The axiom of choice holds iff every ordinal has a well-orderable powerset. (Contributed by Mario Carneiro, 29-May-2015.) |
| Ref | Expression |
|---|---|
| dfac12a | ⊢ (CHOICE ↔ ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssv 3962 | . . . 4 ⊢ dom card ⊆ V | |
| 2 | eqss 3953 | . . . 4 ⊢ (dom card = V ↔ (dom card ⊆ V ∧ V ⊆ dom card)) | |
| 3 | 1, 2 | mpbiran 709 | . . 3 ⊢ (dom card = V ↔ V ⊆ dom card) |
| 4 | dfac10 10051 | . . 3 ⊢ (CHOICE ↔ dom card = V) | |
| 5 | unir1 9728 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 6 | 5 | sseq1i 3966 | . . 3 ⊢ (∪ (𝑅1 “ On) ⊆ dom card ↔ V ⊆ dom card) |
| 7 | 3, 4, 6 | 3bitr4i 303 | . 2 ⊢ (CHOICE ↔ ∪ (𝑅1 “ On) ⊆ dom card) |
| 8 | dfac12r 10060 | . 2 ⊢ (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∪ (𝑅1 “ On) ⊆ dom card) | |
| 9 | 7, 8 | bitr4i 278 | 1 ⊢ (CHOICE ↔ ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∀wral 3044 Vcvv 3438 ⊆ wss 3905 𝒫 cpw 4553 ∪ cuni 4861 dom cdm 5623 “ cima 5626 Oncon0 6311 𝑅1cr1 9677 cardccrd 9850 CHOICEwac 10028 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-reg 9503 ax-inf2 9556 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-oadd 8399 df-omul 8400 df-er 8632 df-en 8880 df-dom 8881 df-oi 9421 df-har 9468 df-r1 9679 df-rank 9680 df-card 9854 df-ac 10029 |
| This theorem is referenced by: dfac12 10063 |
| Copyright terms: Public domain | W3C validator |