| 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 3955 | . . . 4 ⊢ dom card ⊆ V | |
| 2 | eqss 3946 | . . . 4 ⊢ (dom card = V ↔ (dom card ⊆ V ∧ V ⊆ dom card)) | |
| 3 | 1, 2 | mpbiran 722 | . . 3 ⊢ (dom card = V ↔ V ⊆ dom card) |
| 4 | dfac10 10140 | . . 3 ⊢ (CHOICE ↔ dom card = V) | |
| 5 | unir1 9795 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 6 | 5 | sseq1i 3959 | . . 3 ⊢ (∪ (𝑅1 “ On) ⊆ dom card ↔ V ⊆ dom card) |
| 7 | 3, 4, 6 | 3bitr4i 306 | . 2 ⊢ (CHOICE ↔ ∪ (𝑅1 “ On) ⊆ dom card) |
| 8 | dfac12r 10149 | . 2 ⊢ (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∪ (𝑅1 “ On) ⊆ dom card) | |
| 9 | 7, 8 | bitr4i 281 | 1 ⊢ (CHOICE ↔ ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 ⊆ wss 3899 𝒫 cpw 4557 ∪ cuni 4867 dom cdm 5655 “ cima 5658 Oncon0 6357 𝑅1cr1 9744 cardccrd 9940 CHOICEwac 10118 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-reg 9564 ax-inf2 9620 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-oadd 8459 df-omul 8460 df-er 8696 df-en 8953 df-dom 8954 df-oi 9482 df-har 9529 df-r1 9746 df-rank 9747 df-card 9944 df-ac 10119 |
| This theorem is used by: dfac12 10152 |
| Copyright terms: Public domain | W3C validator |