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 10303 using ax-ac 10316 and ax-inf 9495. 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 5096 | . . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (𝑢𝑥𝑤 ↔ 𝑢𝑥𝑧)) | |
2 | 1 | cbvabv 2809 | . . . . . . . 8 ⊢ {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑢𝑥𝑧} |
3 | breq1 5095 | . . . . . . . . 9 ⊢ (𝑢 = 𝑣 → (𝑢𝑥𝑧 ↔ 𝑣𝑥𝑧)) | |
4 | 3 | abbidv 2805 | . . . . . . . 8 ⊢ (𝑢 = 𝑣 → {𝑧 ∣ 𝑢𝑥𝑧} = {𝑧 ∣ 𝑣𝑥𝑧}) |
5 | 2, 4 | eqtrid 2788 | . . . . . . 7 ⊢ (𝑢 = 𝑣 → {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑣𝑥𝑧}) |
6 | 5 | fveq2d 6829 | . . . . . 6 ⊢ (𝑢 = 𝑣 → (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤}) = (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) |
7 | 6 | cbvmptv 5205 | . . . . 5 ⊢ (𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) |
8 | rdgeq1 8312 | . . . . 5 ⊢ ((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦)) | |
9 | reseq1 5917 | . . . . 5 ⊢ (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) → (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) ↾ ω)) | |
10 | 7, 8, 9 | mp2b 10 | . . . 4 ⊢ (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) ↾ ω) |
11 | 10 | axdclem2 10377 | . . 3 ⊢ (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))) |
12 | 11 | exlimiv 1932 | . 2 ⊢ (∃𝑦∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))) |
13 | 12 | imp 407 | 1 ⊢ ((∃𝑦∃𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1540 ∃wex 1780 {cab 2713 ∀wral 3061 Vcvv 3441 ⊆ wss 3898 class class class wbr 5092 ↦ cmpt 5175 dom cdm 5620 ran crn 5621 ↾ cres 5622 suc csuc 6304 ‘cfv 6479 ωcom 7780 reccrdg 8310 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5229 ax-sep 5243 ax-nul 5250 ax-pow 5308 ax-pr 5372 ax-un 7650 ax-inf2 9498 ax-ac2 10320 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4270 df-if 4474 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-tr 5210 df-id 5518 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5575 df-we 5577 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6238 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-ov 7340 df-om 7781 df-2nd 7900 df-frecs 8167 df-wrecs 8198 df-recs 8272 df-rdg 8311 df-ac 9973 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |