| 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 3958 | . . . 4 ⊢ dom card ⊆ V | |
| 2 | eqss 3949 | . . . 4 ⊢ (dom card = V ↔ (dom card ⊆ V ∧ V ⊆ dom card)) | |
| 3 | 1, 2 | mpbiran 709 | . . 3 ⊢ (dom card = V ↔ V ⊆ dom card) |
| 4 | dfac10 10048 | . . 3 ⊢ (CHOICE ↔ dom card = V) | |
| 5 | unir1 9725 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 6 | 5 | sseq1i 3962 | . . 3 ⊢ (∪ (𝑅1 “ On) ⊆ dom card ↔ V ⊆ dom card) |
| 7 | 3, 4, 6 | 3bitr4i 303 | . 2 ⊢ (CHOICE ↔ ∪ (𝑅1 “ On) ⊆ dom card) |
| 8 | dfac12r 10057 | . 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 1541 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 ⊆ wss 3901 𝒫 cpw 4554 ∪ cuni 4863 dom cdm 5624 “ cima 5627 Oncon0 6317 𝑅1cr1 9674 cardccrd 9847 CHOICEwac 10025 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-reg 9497 ax-inf2 9550 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-oadd 8401 df-omul 8402 df-er 8635 df-en 8884 df-dom 8885 df-oi 9415 df-har 9462 df-r1 9676 df-rank 9677 df-card 9851 df-ac 10026 |
| This theorem is referenced by: dfac12 10060 |
| Copyright terms: Public domain | W3C validator |