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

Theorem madefi 28013
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 6867 . . 3 (𝑥 = 𝑦 → ( M ‘𝑥) = ( M ‘𝑦))
21eleq1d 2848 . 2 (𝑥 = 𝑦 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝑦) ∈ Fin))
3 fveq2 6867 . . 3 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
43eleq1d 2848 . 2 (𝑥 = 𝐴 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝐴) ∈ Fin))
5 nnon 7852 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ On)
6 madeval 27932 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
75, 6syl 17 . . . . 5 (𝑥 ∈ ω → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
87adantr 484 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) = ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
9 madef 27936 . . . . . . . . . . 11 M :On⟶𝒫 No
10 ffun 6694 . . . . . . . . . . 11 ( M :On⟶𝒫 No → Fun M )
119, 10ax-mp 5 . . . . . . . . . 10 Fun M
12 nnfi 9136 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ∈ Fin)
13 imafi 9259 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ∈ Fin) → ( M “ 𝑥) ∈ Fin)
1411, 12, 13sylancr 596 . . . . . . . . 9 (𝑥 ∈ ω → ( M “ 𝑥) ∈ Fin)
1514adantr 484 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
16 onss 7768 . . . . . . . . . . . 12 (𝑥 ∈ On → 𝑥 ⊆ On)
175, 16syl 17 . . . . . . . . . . 11 (𝑥 ∈ ω → 𝑥 ⊆ On)
189fdmi 6703 . . . . . . . . . . 11 dom M = On
1917, 18sseqtrrdi 3978 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ⊆ dom M )
20 funimass4 6931 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ⊆ dom M ) → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2111, 19, 20sylancr 596 . . . . . . . . 9 (𝑥 ∈ ω → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin))
2221biimpar 481 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ⊆ Fin)
23 unifi 9285 . . . . . . . 8 ((( M “ 𝑥) ∈ Fin ∧ ( M “ 𝑥) ⊆ Fin) → ( M “ 𝑥) ∈ Fin)
2415, 22, 23syl2anc 593 . . . . . . 7 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
25 pwfi 9262 . . . . . . 7 ( ( M “ 𝑥) ∈ Fin ↔ 𝒫 ( M “ 𝑥) ∈ Fin)
2624, 25sylib 220 . . . . . 6 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → 𝒫 ( M “ 𝑥) ∈ Fin)
27 xpfi 9263 . . . . . 6 ((𝒫 ( M “ 𝑥) ∈ Fin ∧ 𝒫 ( M “ 𝑥) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
2826, 26, 27syl2anc 593 . . . . 5 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin)
29 vex 3459 . . . . . . . . . . 11 𝑥 ∈ V
3029funimaex 6609 . . . . . . . . . 10 (Fun M → ( M “ 𝑥) ∈ V)
3111, 30ax-mp 5 . . . . . . . . 9 ( M “ 𝑥) ∈ V
3231uniex 7724 . . . . . . . 8 ( M “ 𝑥) ∈ V
3332pwex 5338 . . . . . . 7 𝒫 ( M “ 𝑥) ∈ V
3433, 33xpex 7736 . . . . . 6 (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V
35 cutsf 27892 . . . . . . 7 |s : <<s ⟶ No
36 ffun 6694 . . . . . . 7 ( |s : <<s ⟶ No → Fun |s )
3735, 36ax-mp 5 . . . . . 6 Fun |s
38 imadomg 10502 . . . . . 6 ((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ V → (Fun |s → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))))
3934, 37, 38mp2 9 . . . . 5 ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))
40 domfi 9157 . . . . 5 (((𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥)) ∈ Fin ∧ ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ≼ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
4128, 39, 40sylancl 595 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( |s “ (𝒫 ( M “ 𝑥) × 𝒫 ( M “ 𝑥))) ∈ Fin)
428, 41eqeltrd 2863 . . 3 ((𝑥 ∈ ω ∧ ∀𝑦𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) ∈ Fin)
4342ex 416 . 2 (𝑥 ∈ ω → (∀𝑦𝑥 ( M ‘𝑦) ∈ Fin → ( M ‘𝑥) ∈ Fin))
442, 4, 43omsinds 7867 1 (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1561  wcel 2143  wral 3077  Vcvv 3455  wss 3905  𝒫 cpw 4556   cuni 4866   class class class wbr 5101   × cxp 5646  dom cdm 5648  cima 5651  Oncon0 6346  Fun wfun 6515  wf 6517  cfv 6521  ωcom 7846  cdom 8925  Fincfn 8927   No csur 27711   <<s cslts 27857   |s ccuts 27859   M cmade 27922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7718  ax-ac2 10431
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-se 5602  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-isom 6530  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-1o 8437  df-2o 8438  df-er 8678  df-map 8810  df-en 8928  df-dom 8929  df-fin 8931  df-card 9909  df-acn 9912  df-ac 10084  df-no 27714  df-lts 27715  df-bday 27716  df-slts 27858  df-cuts 27860  df-made 27927
This theorem is referenced by:  oldfi  28014
  Copyright terms: Public domain W3C validator