MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axdc Structured version   Visualization version   GIF version

Theorem axdc 10626
Description: This theorem derives ax-dc 10551 using ax-ac 10564 and ax-inf 9666. 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.)
Assertion
Ref Expression
axdc ((∃𝑦∃𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))
Distinct variable group:   𝑓,𝑛,𝑥,𝑦,𝑧

Proof of Theorem axdc
Dummy variables 𝑣 𝑔 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 5110 . . . . . . . . . 10 (𝑤 = 𝑧 → (𝑢𝑥𝑤 ↔ 𝑢𝑥𝑧))
21cbvabv 2834 . . . . . . . . 9 {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑢𝑥𝑧}
3 breq1 5109 . . . . . . . . . 10 (𝑢 = 𝑣 → (𝑢𝑥𝑧 ↔ 𝑣𝑥𝑧))
43abbidv 2829 . . . . . . . . 9 (𝑢 = 𝑣 → {𝑧 ∣ 𝑢𝑥𝑧} = {𝑧 ∣ 𝑣𝑥𝑧})
52, 4eqtrid 2810 . . . . . . . 8 (𝑢 = 𝑣 → {𝑤 ∣ 𝑢𝑥𝑤} = {𝑧 ∣ 𝑣𝑥𝑧})
65fveq2d 6912 . . . . . . 7 (𝑢 = 𝑣 → (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤}) = (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧}))
76cbvmptv 5212 . . . . . 6 (𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧}))
8 rdgeq1 8447 . . . . . 6 ((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦))
97, 8ax-mp 5 . . . . 5 rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦)
109reseq1i 5977 . . . 4 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤 ∣ 𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑣𝑥𝑧})), 𝑦) ↾ ω)
1110axdclem2 10625 . . 3 (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)))
1211exlimiv 1965 . 2 (∃𝑦∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)))
1312imp 412 1 ((∃𝑦∃𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812  {cab 2741  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   class class class wbr 5106   ↦ cmpt 5189  dom cdm 5655  ran crn 5656   ↾ cres 5657  suc csuc 6382  ‘cfv 6558  ωcom 7901  reccrdg 8445
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669  ax-ac2 10568
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  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 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-ac 10222
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator