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

Theorem axdc 9945
Description: This theorem derives ax-dc 9870 using ax-ac 9883 and ax-inf 9103. 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 5072 . . . . . . . . 9 (𝑤 = 𝑧 → (𝑢𝑥𝑤𝑢𝑥𝑧))
21cbvabv 2891 . . . . . . . 8 {𝑤𝑢𝑥𝑤} = {𝑧𝑢𝑥𝑧}
3 breq1 5071 . . . . . . . . 9 (𝑢 = 𝑣 → (𝑢𝑥𝑧𝑣𝑥𝑧))
43abbidv 2887 . . . . . . . 8 (𝑢 = 𝑣 → {𝑧𝑢𝑥𝑧} = {𝑧𝑣𝑥𝑧})
52, 4syl5eq 2870 . . . . . . 7 (𝑢 = 𝑣 → {𝑤𝑢𝑥𝑤} = {𝑧𝑣𝑥𝑧})
65fveq2d 6676 . . . . . 6 (𝑢 = 𝑣 → (𝑔‘{𝑤𝑢𝑥𝑤}) = (𝑔‘{𝑧𝑣𝑥𝑧}))
76cbvmptv 5171 . . . . 5 (𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧}))
8 rdgeq1 8049 . . . . 5 ((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})) = (𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})) → rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦))
9 reseq1 5849 . . . . 5 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) = rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) → (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω))
107, 8, 9mp2b 10 . . . 4 (rec((𝑢 ∈ V ↦ (𝑔‘{𝑤𝑢𝑥𝑤})), 𝑦) ↾ ω) = (rec((𝑣 ∈ V ↦ (𝑔‘{𝑧𝑣𝑥𝑧})), 𝑦) ↾ ω)
1110axdclem2 9944 . . 3 (∃𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1211exlimiv 1931 . 2 (∃𝑦𝑧 𝑦𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
1312imp 409 1 ((∃𝑦𝑧 𝑦𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wex 1780  {cab 2801  wral 3140  Vcvv 3496  wss 3938   class class class wbr 5068  cmpt 5148  dom cdm 5557  ran crn 5558  cres 5559  suc csuc 6195  cfv 6357  ωcom 7582  reccrdg 8047
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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-inf2 9106  ax-ac2 9887
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-ac 9544
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator