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

Theorem axdc 9946
Description: This theorem derives ax-dc 9871 using ax-ac 9884 and ax-inf 9104. 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 5073 . . . . . . . . 9 (𝑤 = 𝑧 → (𝑢𝑥𝑤𝑢𝑥𝑧))
21cbvabv 2892 . . . . . . . 8 {𝑤𝑢𝑥𝑤} = {𝑧𝑢𝑥𝑧}
3 breq1 5072 . . . . . . . . 9 (𝑢 = 𝑣 → (𝑢𝑥𝑧𝑣𝑥𝑧))
43abbidv 2888 . . . . . . . 8 (𝑢 = 𝑣 → {𝑧𝑢𝑥𝑧} = {𝑧𝑣𝑥𝑧})
52, 4syl5eq 2871 . . . . . . 7 (𝑢 = 𝑣 → {𝑤𝑢𝑥𝑤} = {𝑧𝑣𝑥𝑧})
65fveq2d 6677 . . . . . 6 (𝑢 = 𝑣 → (𝑔‘{𝑤𝑢𝑥𝑤}) = (𝑔‘{𝑧𝑣𝑥𝑧}))
76cbvmptv 5172 . . . . 5 (𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧}))
8 rdgeq1 8050 . . . . 5 ((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦))
9 reseq1 5850 . . . . 5 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) → (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω))
107, 8, 9mp2b 10 . . . 4 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω)
1110axdclem2 9945 . . 3 (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1211exlimiv 1930 . 2 (∃𝑦𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1312imp 409 1 ((∃𝑦𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wex 1779  {cab 2802  wral 3141  Vcvv 3497  wss 3939   class class class wbr 5069  cmpt 5149  dom cdm 5558  ran crn 5559  cres 5560  suc csuc 6196  cfv 6358  ωcom 7583  reccrdg 8048
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-inf2 9107  ax-ac2 9888
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-om 7584  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-ac 9545
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator