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

Theorem axdc 10527
Description: This theorem derives ax-dc 10452 using ax-ac 10465 and ax-inf 9621. 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 5111 . . . . . . . . . 10 (𝑤 = 𝑧 → (𝑢𝑥𝑤𝑢𝑥𝑧))
21cbvabv 2832 . . . . . . . . 9 {𝑤𝑢𝑥𝑤} = {𝑧𝑢𝑥𝑧}
3 breq1 5110 . . . . . . . . . 10 (𝑢 = 𝑣 → (𝑢𝑥𝑧𝑣𝑥𝑧))
43abbidv 2828 . . . . . . . . 9 (𝑢 = 𝑣 → {𝑧𝑢𝑥𝑧} = {𝑧𝑣𝑥𝑧})
52, 4eqtrid 2809 . . . . . . . 8 (𝑢 = 𝑣 → {𝑤𝑢𝑥𝑤} = {𝑧𝑣𝑥𝑧})
65fveq2d 6886 . . . . . . 7 (𝑢 = 𝑣 → (𝑔‘{𝑤𝑢𝑥𝑤}) = (𝑔‘{𝑧𝑣𝑥𝑧}))
76cbvmptv 5213 . . . . . 6 (𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧}))
8 rdgeq1 8404 . . . . . 6 ((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦))
97, 8ax-mp 5 . . . . 5 rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦)
109reseq1i 5972 . . . 4 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω)
1110axdclem2 10526 . . 3 (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1211exlimiv 1963 . 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 2740  wral 3078  Vcvv 3453  wss 3902   class class class wbr 5107  cmpt 5190  dom cdm 5659  ran crn 5660  cres 5661  suc csuc 6363  cfv 6537  ωcom 7866  reccrdg 8402
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-inf2 9624  ax-ac2 10469
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-ac 10123
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator