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

Theorem axdc 10561
Description: This theorem derives ax-dc 10486 using ax-ac 10499 and ax-inf 9678. 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 5147 . . . . . . . . . 10 (𝑤 = 𝑧 → (𝑢𝑥𝑤𝑢𝑥𝑧))
21cbvabv 2812 . . . . . . . . 9 {𝑤𝑢𝑥𝑤} = {𝑧𝑢𝑥𝑧}
3 breq1 5146 . . . . . . . . . 10 (𝑢 = 𝑣 → (𝑢𝑥𝑧𝑣𝑥𝑧))
43abbidv 2808 . . . . . . . . 9 (𝑢 = 𝑣 → {𝑧𝑢𝑥𝑧} = {𝑧𝑣𝑥𝑧})
52, 4eqtrid 2789 . . . . . . . 8 (𝑢 = 𝑣 → {𝑤𝑢𝑥𝑤} = {𝑧𝑣𝑥𝑧})
65fveq2d 6910 . . . . . . 7 (𝑢 = 𝑣 → (𝑔‘{𝑤𝑢𝑥𝑤}) = (𝑔‘{𝑧𝑣𝑥𝑧}))
76cbvmptv 5255 . . . . . 6 (𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧}))
8 rdgeq1 8451 . . . . . 6 ((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦))
97, 8ax-mp 5 . . . . 5 rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦)
109reseq1i 5993 . . . 4 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω)
1110axdclem2 10560 . . 3 (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1211exlimiv 1930 . 2 (∃𝑦𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1312imp 406 1 ((∃𝑦𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wex 1779  {cab 2714  wral 3061  Vcvv 3480  wss 3951   class class class wbr 5143  cmpt 5225  dom cdm 5685  ran crn 5686  cres 5687  suc csuc 6386  cfv 6561  ωcom 7887  reccrdg 8449
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  ax-inf2 9681  ax-ac2 10503
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-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-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-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-lim 6389  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-ov 7434  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-ac 10156
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator