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

Theorem madefi 27895
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 6835 . . 3 (𝑥 = 𝑦 → ( M ‘𝑥) = ( M ‘𝑦))
21eleq1d 2822 . 2 (𝑥 = 𝑦 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝑦) ∈ Fin))
3 fveq2 6835 . . 3 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
43eleq1d 2822 . 2 (𝑥 = 𝐴 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝐴) ∈ Fin))
5 nnon 7816 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ On)
6 madeval 27830 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
75, 6syl 17 . . . . 5 (𝑥 ∈ ω → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
87adantr 480 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
9 madef 27834 . . . . . . . . . . 11 M :On⟶𝒫 No
10 ffun 6666 . . . . . . . . . . 11 ( M :On⟶𝒫 No → Fun M )
119, 10ax-mp 5 . . . . . . . . . 10 Fun M
12 nnfi 9096 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ∈ Fin)
13 imafi 9219 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ∈ Fin) → ( M “ 𝑥) ∈ Fin)
1411, 12, 13sylancr 588 . . . . . . . . 9 (𝑥 ∈ ω → ( M “ 𝑥) ∈ Fin)
1514adantr 480 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
16 onss 7732 . . . . . . . . . . . 12 (𝑥 ∈ On → 𝑥 ⊆ On)
175, 16syl 17 . . . . . . . . . . 11 (𝑥 ∈ ω → 𝑥 ⊆ On)
189fdmi 6674 . . . . . . . . . . 11 dom M = On
1917, 18sseqtrrdi 3976 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ⊆ dom M )
20 funimass4 6899 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ⊆ dom M ) → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2111, 19, 20sylancr 588 . . . . . . . . 9 (𝑥 ∈ ω → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2221biimpar 477 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ⊆ Fin)
23 unifi 9248 . . . . . . . 8 ((( M “ 𝑥) ∈ Fin ∧ ( M “ 𝑥) ⊆ Fin) → ( M “ 𝑥) ∈ Fin)
2415, 22, 23syl2anc 585 . . . . . . 7 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
25 pwfi 9223 . . . . . . 7 ( ( M “ 𝑥) ∈ Fin ↔ 𝒫 ( M “ 𝑥) ∈ Fin)
2624, 25sylib 218 . . . . . 6 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → 𝒫 ( M “ 𝑥) ∈ Fin)
27 xpfi 9224 . . . . . 6 ((𝒫 ( M “ 𝑥) ∈ Fin ∧ 𝒫 ( M “ 𝑥) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
2826, 26, 27syl2anc 585 . . . . 5 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
29 vex 3445 . . . . . . . . . . 11 𝑥 ∈ V
3029funimaex 6581 . . . . . . . . . 10 (Fun M → ( M “ 𝑥) ∈ V)
3111, 30ax-mp 5 . . . . . . . . 9 ( M “ 𝑥) ∈ V
3231uniex 7688 . . . . . . . 8 ( M “ 𝑥) ∈ V
3332pwex 5326 . . . . . . 7 𝒫 ( M “ 𝑥) ∈ V
3433, 33xpex 7700 . . . . . 6 (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V
35 scutf 27790 . . . . . . 7 |s : <<s ⟶ No
36 ffun 6666 . . . . . . 7 ( |s : <<s ⟶ No → Fun |s )
3735, 36ax-mp 5 . . . . . 6 Fun |s
38 imadomg 10448 . . . . . 6 ((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V → (Fun |s → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
3934, 37, 38mp2 9 . . . . 5 ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))
40 domfi 9117 . . . . 5 (((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin ∧ ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
4128, 39, 40sylancl 587 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
428, 41eqeltrd 2837 . . 3 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) ∈ Fin)
4342ex 412 . 2 (𝑥 ∈ ω → (∀𝑦𝑥 ( M ‘𝑦) ∈ Fin → ( M ‘𝑥) ∈ Fin))
442, 4, 43omsinds 7831 1 (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3441  wss 3902  𝒫 cpw 4555   cuni 4864   class class class wbr 5099   × cxp 5623  dom cdm 5625  cima 5628  Oncon0 6318  Fun wfun 6487  wf 6489  cfv 6493  ωcom 7810  cdom 8885  Fincfn 8887   No csur 27611   <<s csslt 27757   |s cscut 27759   M cmade 27820
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-ac2 10377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-1o 8399  df-2o 8400  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-fin 8891  df-card 9855  df-acn 9858  df-ac 10030  df-no 27614  df-slt 27615  df-bday 27616  df-sslt 27758  df-scut 27760  df-made 27825
This theorem is referenced by:  oldfi  27896
  Copyright terms: Public domain W3C validator