![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > axdc | Structured version Visualization version GIF version |
Description: This theorem derives ax-dc 10463 using ax-ac 10476 and ax-inf 9655. Thus, AC implies DC, but not vice-versa (so that ZFC is strictly stronger than ZF+DC). (New usage is discouraged.) (Contributed by Mario Carneiro, 25-Jan-2013.) |
Ref | Expression |
---|---|
axdc | ⊢ ((∃𝑦∃𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq2 5146 | . . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (𝑢𝑥𝑤 ↔ 𝑢𝑥𝑧)) | |
2 | 1 | cbvabv 2801 | . . . . . . . 8 ⊢ {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑢𝑥𝑧} |
3 | breq1 5145 | . . . . . . . . 9 ⊢ (𝑢 = 𝑣 → (𝑢𝑥𝑧 ↔ 𝑣𝑥𝑧)) | |
4 | 3 | abbidv 2797 | . . . . . . . 8 ⊢ (𝑢 = 𝑣 → {𝑧 ∣ 𝑢𝑥𝑧} = {𝑧 ∣ 𝑣𝑥𝑧}) |
5 | 2, 4 | eqtrid 2780 | . . . . . . 7 ⊢ (𝑢 = 𝑣 → {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑣𝑥𝑧}) |
6 | 5 | fveq2d 6895 | . . . . . 6 ⊢ (𝑢 = 𝑣 → (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤}) = (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) |
7 | 6 | cbvmptv 5255 | . . . . 5 ⊢ (𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) |
8 | rdgeq1 8425 | . . . . 5 ⊢ ((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦)) | |
9 | reseq1 5973 | . . . . 5 ⊢ (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) → (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) ↾ ω)) | |
10 | 7, 8, 9 | mp2b 10 | . . . 4 ⊢ (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) ↾ ω) |
11 | 10 | axdclem2 10537 | . . 3 ⊢ (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))) |
12 | 11 | exlimiv 1926 | . 2 ⊢ (∃𝑦∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))) |
13 | 12 | imp 406 | 1 ⊢ ((∃𝑦∃𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∃wex 1774 {cab 2705 ∀wral 3057 Vcvv 3470 ⊆ wss 3945 class class class wbr 5142 ↦ cmpt 5225 dom cdm 5672 ran crn 5673 ↾ cres 5674 suc csuc 6365 ‘cfv 6542 ωcom 7864 reccrdg 8423 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-inf2 9658 ax-ac2 10480 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3964 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7417 df-om 7865 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-ac 10133 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |