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

Theorem cfsmo 10165
Description: The map in cff1 10152 can be assumed to be a strictly monotone ordinal function without loss of generality. (Contributed by Mario Carneiro, 28-Feb-2013.)
Assertion
Ref Expression
cfsmo (𝐴 ∈ On → ∃𝑓(𝑓:(cf‘𝐴)⟶𝐴 ∧ Smo 𝑓 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
Distinct variable group:   𝐴,𝑓,𝑤,𝑧

Proof of Theorem cfsmo
Dummy variables 𝑚 𝑥 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmeq 5846 . . . . 5 (𝑥 = 𝑧 → dom 𝑥 = dom 𝑧)
21fveq2d 6826 . . . 4 (𝑥 = 𝑧 → (‘dom 𝑥) = (‘dom 𝑧))
3 fveq2 6822 . . . . . . 7 (𝑛 = 𝑚 → (𝑥𝑛) = (𝑥𝑚))
4 suceq 6375 . . . . . . 7 ((𝑥𝑛) = (𝑥𝑚) → suc (𝑥𝑛) = suc (𝑥𝑚))
53, 4syl 17 . . . . . 6 (𝑛 = 𝑚 → suc (𝑥𝑛) = suc (𝑥𝑚))
65cbviunv 4989 . . . . 5 𝑛 ∈ dom 𝑥 suc (𝑥𝑛) = 𝑚 ∈ dom 𝑥 suc (𝑥𝑚)
7 fveq1 6821 . . . . . . 7 (𝑥 = 𝑧 → (𝑥𝑚) = (𝑧𝑚))
8 suceq 6375 . . . . . . 7 ((𝑥𝑚) = (𝑧𝑚) → suc (𝑥𝑚) = suc (𝑧𝑚))
97, 8syl 17 . . . . . 6 (𝑥 = 𝑧 → suc (𝑥𝑚) = suc (𝑧𝑚))
101, 9iuneq12d 4971 . . . . 5 (𝑥 = 𝑧 𝑚 ∈ dom 𝑥 suc (𝑥𝑚) = 𝑚 ∈ dom 𝑧 suc (𝑧𝑚))
116, 10eqtrid 2776 . . . 4 (𝑥 = 𝑧 𝑛 ∈ dom 𝑥 suc (𝑥𝑛) = 𝑚 ∈ dom 𝑧 suc (𝑧𝑚))
122, 11uneq12d 4120 . . 3 (𝑥 = 𝑧 → ((‘dom 𝑥) ∪ 𝑛 ∈ dom 𝑥 suc (𝑥𝑛)) = ((‘dom 𝑧) ∪ 𝑚 ∈ dom 𝑧 suc (𝑧𝑚)))
1312cbvmptv 5196 . 2 (𝑥 ∈ V ↦ ((‘dom 𝑥) ∪ 𝑛 ∈ dom 𝑥 suc (𝑥𝑛))) = (𝑧 ∈ V ↦ ((‘dom 𝑧) ∪ 𝑚 ∈ dom 𝑧 suc (𝑧𝑚)))
14 eqid 2729 . 2 (recs((𝑥 ∈ V ↦ ((‘dom 𝑥) ∪ 𝑛 ∈ dom 𝑥 suc (𝑥𝑛)))) ↾ (cf‘𝐴)) = (recs((𝑥 ∈ V ↦ ((‘dom 𝑥) ∪ 𝑛 ∈ dom 𝑥 suc (𝑥𝑛)))) ↾ (cf‘𝐴))
1513, 14cfsmolem 10164 1 (𝐴 ∈ On → ∃𝑓(𝑓:(cf‘𝐴)⟶𝐴 ∧ Smo 𝑓 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1540  wex 1779  wcel 2109  wral 3044  wrex 3053  Vcvv 3436  cun 3901  wss 3903   ciun 4941  cmpt 5173  dom cdm 5619  cres 5621  Oncon0 6307  suc csuc 6309  wf 6478  cfv 6482  Smo wsmo 8268  recscrecs 8293  cfccf 9833
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-isom 6491  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-smo 8269  df-recs 8294  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-card 9835  df-cf 9837  df-acn 9838
This theorem is referenced by:  cfidm  10169  pwcfsdom  10477
  Copyright terms: Public domain W3C validator