| 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 3946 | . . . 4 ⊢ dom card ⊆ V | |
| 2 | eqss 3937 | . . . 4 ⊢ (dom card = V ↔ (dom card ⊆ V ∧ V ⊆ dom card)) | |
| 3 | 1, 2 | mpbiran 710 | . . 3 ⊢ (dom card = V ↔ V ⊆ dom card) |
| 4 | dfac10 10060 | . . 3 ⊢ (CHOICE ↔ dom card = V) | |
| 5 | unir1 9737 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 6 | 5 | sseq1i 3950 | . . 3 ⊢ (∪ (𝑅1 “ On) ⊆ dom card ↔ V ⊆ dom card) |
| 7 | 3, 4, 6 | 3bitr4i 303 | . 2 ⊢ (CHOICE ↔ ∪ (𝑅1 “ On) ⊆ dom card) |
| 8 | dfac12r 10069 | . 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 1542 ∈ wcel 2114 ∀wral 3051 Vcvv 3429 ⊆ wss 3889 𝒫 cpw 4541 ∪ cuni 4850 dom cdm 5631 “ cima 5634 Oncon0 6323 𝑅1cr1 9686 cardccrd 9859 CHOICEwac 10037 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-reg 9507 ax-inf2 9562 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-oadd 8409 df-omul 8410 df-er 8643 df-en 8894 df-dom 8895 df-oi 9425 df-har 9472 df-r1 9688 df-rank 9689 df-card 9863 df-ac 10038 |
| This theorem is referenced by: dfac12 10072 |
| Copyright terms: Public domain | W3C validator |