| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfac8 | Structured version Visualization version GIF version | ||
| Description: A proof of the equivalency of the well-ordering theorem weth 10535 and the axiom of choice ac7 10513. (Contributed by Mario Carneiro, 5-Jan-2013.) |
| Ref | Expression |
|---|---|
| dfac8 | ⊢ (CHOICE ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfac3 10161 | . 2 ⊢ (CHOICE ↔ ∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) | |
| 2 | vex 3484 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | vpwex 5377 | . . . . . . 7 ⊢ 𝒫 𝑥 ∈ V | |
| 4 | raleq 3323 | . . . . . . . 8 ⊢ (𝑦 = 𝒫 𝑥 → (∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) | |
| 5 | 4 | exbidv 1921 | . . . . . . 7 ⊢ (𝑦 = 𝒫 𝑥 → (∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) |
| 6 | 3, 5 | spcv 3605 | . . . . . 6 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
| 7 | dfac8a 10070 | . . . . . 6 ⊢ (𝑥 ∈ V → (∃𝑓∀𝑧 ∈ 𝒫 𝑥(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → 𝑥 ∈ dom card)) | |
| 8 | 2, 6, 7 | mpsyl 68 | . . . . 5 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → 𝑥 ∈ dom card) |
| 9 | dfac8b 10071 | . . . . 5 ⊢ (𝑥 ∈ dom card → ∃𝑟 𝑟 We 𝑥) | |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑟 𝑟 We 𝑥) |
| 11 | 10 | alrimiv 1927 | . . 3 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∀𝑥∃𝑟 𝑟 We 𝑥) |
| 12 | vex 3484 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 13 | vuniex 7759 | . . . . . 6 ⊢ ∪ 𝑦 ∈ V | |
| 14 | weeq2 5673 | . . . . . . 7 ⊢ (𝑥 = ∪ 𝑦 → (𝑟 We 𝑥 ↔ 𝑟 We ∪ 𝑦)) | |
| 15 | 14 | exbidv 1921 | . . . . . 6 ⊢ (𝑥 = ∪ 𝑦 → (∃𝑟 𝑟 We 𝑥 ↔ ∃𝑟 𝑟 We ∪ 𝑦)) |
| 16 | 13, 15 | spcv 3605 | . . . . 5 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∃𝑟 𝑟 We ∪ 𝑦) |
| 17 | dfac8c 10073 | . . . . 5 ⊢ (𝑦 ∈ V → (∃𝑟 𝑟 We ∪ 𝑦 → ∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))) | |
| 18 | 12, 16, 17 | mpsyl 68 | . . . 4 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
| 19 | 18 | alrimiv 1927 | . . 3 ⊢ (∀𝑥∃𝑟 𝑟 We 𝑥 → ∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)) |
| 20 | 11, 19 | impbii 209 | . 2 ⊢ (∀𝑦∃𝑓∀𝑧 ∈ 𝑦 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
| 21 | 1, 20 | bitri 275 | 1 ⊢ (CHOICE ↔ ∀𝑥∃𝑟 𝑟 We 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1538 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ≠ wne 2940 ∀wral 3061 Vcvv 3480 ∅c0 4333 𝒫 cpw 4600 ∪ cuni 4907 We wwe 5636 dom cdm 5685 ‘cfv 6561 cardccrd 9975 CHOICEwac 10155 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-en 8986 df-card 9979 df-ac 10156 |
| This theorem is referenced by: dfac10 10178 weth 10535 dfac11 43074 |
| Copyright terms: Public domain | W3C validator |