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

Theorem madefi 28232
Description: The made set of an ordinal natural is finite. (Contributed by Scott Fenton, 20-Aug-2025.) (Proof shortened by Vincent Gonzalez, 19-Aug-2026.)
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 6873 . . 3 (𝑥 = 𝑦 → ( M ‘𝑥) = ( M ‘𝑦))
21eleq1d 2845 . 2 (𝑥 = 𝑦 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝑦) ∈ Fin))
3 fveq2 6873 . . 3 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
43eleq1d 2845 . 2 (𝑥 = 𝐴 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝐴) ∈ Fin))
5 nnon 7866 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ On)
6 madeval 28151 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
75, 6syl 18 . . . . 5 (𝑥 ∈ ω → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
87adantr 486 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
9 cutsf 28111 . . . . . 6 |s : <<s ⟶ No
10 ffun 6700 . . . . . 6 ( |s : <<s ⟶ No → Fun |s )
119, 10ax-mp 5 . . . . 5 Fun |s
12 madef 28155 . . . . . . . . . . 11 M :On⟶𝒫 No
13 ffun 6700 . . . . . . . . . . 11 ( M :On⟶𝒫 No → Fun M )
1412, 13ax-mp 5 . . . . . . . . . 10 Fun M
15 nnfi 9161 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ∈ Fin)
16 imafi 9285 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ∈ Fin) → ( M “ 𝑥) ∈ Fin)
1714, 15, 16sylancr 599 . . . . . . . . 9 (𝑥 ∈ ω → ( M “ 𝑥) ∈ Fin)
1817adantr 486 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
19 onss 7782 . . . . . . . . . . . 12 (𝑥 ∈ On → 𝑥 ⊆ On)
205, 19syl 18 . . . . . . . . . . 11 (𝑥 ∈ ω → 𝑥 ⊆ On)
2112fdmi 6709 . . . . . . . . . . 11 dom M = On
2220, 21sseqtrrdi 3971 . . . . . . . . . 10 (𝑥 ∈ ω → 𝑥 ⊆ dom M )
23 funimass4 6937 . . . . . . . . . 10 ((Fun M ∧ 𝑥 ⊆ dom M ) → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin))
2414, 22, 23sylancr 599 . . . . . . . . 9 (𝑥 ∈ ω → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin))
2524biimpar 483 . . . . . . . 8 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ⊆ Fin)
26 unifi 9311 . . . . . . . 8 ((( M “ 𝑥) ∈ Fin ∧ ( M “ 𝑥) ⊆ Fin) → ∪ ( M “ 𝑥) ∈ Fin)
2718, 25, 26syl2anc 596 . . . . . . 7 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ∪ ( M “ 𝑥) ∈ Fin)
28 pwfi 9288 . . . . . . 7 (∪ ( M “ 𝑥) ∈ Fin ↔ 𝒫 ∪ ( M “ 𝑥) ∈ Fin)
2927, 28sylib 221 . . . . . 6 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → 𝒫 ∪ ( M “ 𝑥) ∈ Fin)
30 xpfi 9289 . . . . . 6 ((𝒫 ∪ ( M “ 𝑥) ∈ Fin ∧ 𝒫 ∪ ( M “ 𝑥) ∈ Fin) → (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin)
3129, 29, 30syl2anc 596 . . . . 5 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin)
32 imafi 9285 . . . . 5 ((Fun |s ∧ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin) → ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ∈ Fin)
3311, 31, 32sylancr 599 . . . 4 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ∈ Fin)
348, 33eqeltrd 2860 . . 3 ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) ∈ Fin)
3534ex 418 . 2 (𝑥 ∈ ω → (∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin → ( M ‘𝑥) ∈ Fin))
362, 4, 35omsinds 7881 1 (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ⊆ wss 3898  𝒫 cpw 4556  ∪ cuni 4866   × cxp 5645  dom cdm 5647   “ cima 5650  Oncon0 6351  Fun wfun 6521  ⟶wf 6523  ‘cfv 6527  ωcom 7860  Fincfn 8951   No csur 27930   <<s cslts 28076   |s ccuts 28078   M cmade 28141
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  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 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-1o 8454  df-2o 8455  df-en 8952  df-dom 8953  df-fin 8955  df-no 27933  df-lts 27934  df-bday 27935  df-slts 28077  df-cuts 28079  df-made 28146
This theorem is used by:  oldfi  28233
  Copyright terms: Public domain W3C validator