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

Theorem madefi 27972
Description: The made set of an ordinal natural is finite. (Contributed by Scott Fenton, 20-Aug-2025.)
Assertion
Ref Expression
madefi (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)

Proof of Theorem madefi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6852 . . 3 (𝑥 = 𝑦 → ( M ‘𝑥) = ( M ‘𝑦))
21eleq1d 2837 . 2 (𝑥 = 𝑦 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝑦) ∈ Fin))
3 fveq2 6852 . . 3 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
43eleq1d 2837 . 2 (𝑥 = 𝐴 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝐴) ∈ Fin))
5 nnon 7837 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ On)
6 madeval 27891 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
75, 6syl 17 . . . . 5 (𝑥 ∈ ω → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
87adantr 483 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
9 madef 27895 . . . . . . . . . . 11 M :On⟶𝒫 No
10 ffun 6679 . . . . . . . . . . 11 ( M :On⟶𝒫 No → Fun M )
119, 10ax-mp 5 . . . . . . . . . 10 Fun M
12 nnfi 9121 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ∈ Fin)
13 imafi 9244 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ∈ Fin) → ( M “ 𝑥) ∈ Fin)
1411, 12, 13sylancr 595 . . . . . . . . 9 (𝑥 ∈ ω → ( M “ 𝑥) ∈ Fin)
1514adantr 483 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
16 onss 7753 . . . . . . . . . . . 12 (𝑥 ∈ On → 𝑥 ⊆ On)
175, 16syl 17 . . . . . . . . . . 11 (𝑥 ∈ ω → 𝑥 ⊆ On)
189fdmi 6688 . . . . . . . . . . 11 dom M = On
1917, 18sseqtrrdi 3968 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ⊆ dom M )
20 funimass4 6916 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ⊆ dom M ) → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2111, 19, 20sylancr 595 . . . . . . . . 9 (𝑥 ∈ ω → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2221biimpar 480 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ⊆ Fin)
23 unifi 9273 . . . . . . . 8 ((( M “ 𝑥) ∈ Fin ∧ ( M “ 𝑥) ⊆ Fin) → ( M “ 𝑥) ∈ Fin)
2415, 22, 23syl2anc 592 . . . . . . 7 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
25 pwfi 9248 . . . . . . 7 ( ( M “ 𝑥) ∈ Fin ↔ 𝒫 ( M “ 𝑥) ∈ Fin)
2624, 25sylib 220 . . . . . 6 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → 𝒫 ( M “ 𝑥) ∈ Fin)
27 xpfi 9249 . . . . . 6 ((𝒫 ( M “ 𝑥) ∈ Fin ∧ 𝒫 ( M “ 𝑥) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
2826, 26, 27syl2anc 592 . . . . 5 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
29 vex 3448 . . . . . . . . . . 11 𝑥 ∈ V
3029funimaex 6594 . . . . . . . . . 10 (Fun M → ( M “ 𝑥) ∈ V)
3111, 30ax-mp 5 . . . . . . . . 9 ( M “ 𝑥) ∈ V
3231uniex 7709 . . . . . . . 8 ( M “ 𝑥) ∈ V
3332pwex 5327 . . . . . . 7 𝒫 ( M “ 𝑥) ∈ V
3433, 33xpex 7721 . . . . . 6 (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V
35 cutsf 27851 . . . . . . 7 |s : <<s ⟶ No
36 ffun 6679 . . . . . . 7 ( |s : <<s ⟶ No → Fun |s )
3735, 36ax-mp 5 . . . . . 6 Fun |s
38 imadomg 10477 . . . . . 6 ((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V → (Fun |s → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
3934, 37, 38mp2 9 . . . . 5 ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))
40 domfi 9142 . . . . 5 (((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin ∧ ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
4128, 39, 40sylancl 594 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
428, 41eqeltrd 2852 . . 3 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) ∈ Fin)
4342ex 415 . 2 (𝑥 ∈ ω → (∀𝑦𝑥 ( M ‘𝑦) ∈ Fin → ( M ‘𝑥) ∈ Fin))
442, 4, 43omsinds 7852 1 (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1550  wcel 2132  wral 3066  Vcvv 3444  wss 3895  𝒫 cpw 4545   cuni 4855   class class class wbr 5090   × cxp 5634  dom cdm 5636  cima 5639  Oncon0 6331  Fun wfun 6500  wf 6502  cfv 6506  ωcom 7831  cdom 8910  Fincfn 8912   No csur 27670   <<s cslts 27816   |s ccuts 27818   M cmade 27881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703  ax-ac2 10406
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-tp 4577  df-op 4579  df-uni 4856  df-int 4896  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-se 5590  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-isom 6515  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-om 7832  df-1st 7955  df-2nd 7956  df-frecs 8246  df-wrecs 8277  df-recs 8326  df-1o 8421  df-2o 8422  df-er 8662  df-map 8794  df-en 8913  df-dom 8914  df-fin 8916  df-card 9883  df-acn 9886  df-ac 10058  df-no 27673  df-lts 27674  df-bday 27675  df-slts 27817  df-cuts 27819  df-made 27886
This theorem is referenced by:  oldfi  27973
  Copyright terms: Public domain W3C validator