Theorem madefi 28117

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.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . 3 ⊢ (𝑥 = 𝑦 → ( M ‘𝑥) = ( M ‘𝑦))
2	1	eleq1d 2847	. 2 ⊢ (𝑥 = 𝑦 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝑦) ∈ Fin))
3		fveq2 6881	. . 3 ⊢ (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
4	3	eleq1d 2847	. 2 ⊢ (𝑥 = 𝐴 → (( M ‘𝑥) ∈ Fin ↔ ( M ‘𝐴) ∈ Fin))
5		nnon 7866	. . . . . 6 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
6		madeval 28036	. . . . . 6 ⊢ (𝑥 ∈ On → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
7	5, 6	syl 18	. . . . 5 ⊢ (𝑥 ∈ ω → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
8	7	adantr 485	. . . 4 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) = ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
9		madef 28040	. . . . . . . . . . 11 ⊢ M :On⟶𝒫 No
10		ffun 6708	. . . . . . . . . . 11 ⊢ ( M :On⟶𝒫 No → Fun M )
11	9, 10	ax-mp 5	. . . . . . . . . 10 ⊢ Fun M
12		nnfi 9150	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → 𝑥 ∈ Fin)
13		imafi 9273	. . . . . . . . . 10 ⊢ ((Fun M ∧ 𝑥 ∈ Fin) → ( M “ 𝑥) ∈ Fin)
14	11, 12, 13	sylancr 598	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ( M “ 𝑥) ∈ Fin)
15	14	adantr 485	. . . . . . . 8 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ∈ Fin)
16		onss 7782	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → 𝑥 ⊆ On)
17	5, 16	syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ω → 𝑥 ⊆ On)
18	9	fdmi 6717	. . . . . . . . . . 11 ⊢ dom M = On
19	17, 18	sseqtrrdi 3977	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → 𝑥 ⊆ dom M )
20		funimass4 6945	. . . . . . . . . 10 ⊢ ((Fun M ∧ 𝑥 ⊆ dom M ) → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin))
21	11, 19, 20	sylancr 598	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → (( M “ 𝑥) ⊆ Fin ↔ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin))
22	21	biimpar 482	. . . . . . . 8 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M “ 𝑥) ⊆ Fin)
23		unifi 9299	. . . . . . . 8 ⊢ ((( M “ 𝑥) ∈ Fin ∧ ( M “ 𝑥) ⊆ Fin) → ∪ ( M “ 𝑥) ∈ Fin)
24	15, 22, 23	syl2anc 595	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ∪ ( M “ 𝑥) ∈ Fin)
25		pwfi 9276	. . . . . . 7 ⊢ (∪ ( M “ 𝑥) ∈ Fin ↔ 𝒫 ∪ ( M “ 𝑥) ∈ Fin)
26	24, 25	sylib 221	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → 𝒫 ∪ ( M “ 𝑥) ∈ Fin)
27		xpfi 9277	. . . . . 6 ⊢ ((𝒫 ∪ ( M “ 𝑥) ∈ Fin ∧ 𝒫 ∪ ( M “ 𝑥) ∈ Fin) → (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin)
28	26, 26, 27	syl2anc 595	. . . . 5 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin)
29		vex 3458	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
30	29	funimaex 6623	. . . . . . . . . 10 ⊢ (Fun M → ( M “ 𝑥) ∈ V)
31	11, 30	ax-mp 5	. . . . . . . . 9 ⊢ ( M “ 𝑥) ∈ V
32	31	uniex 7741	. . . . . . . 8 ⊢ ∪ ( M “ 𝑥) ∈ V
33	32	pwex 5350	. . . . . . 7 ⊢ 𝒫 ∪ ( M “ 𝑥) ∈ V
34	33, 33	xpex 7750	. . . . . 6 ⊢ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ V
35		cutsf 27996	. . . . . . 7 ⊢ |s : <<s ⟶ No
36		ffun 6708	. . . . . . 7 ⊢ ( |s : <<s ⟶ No → Fun |s )
37	35, 36	ax-mp 5	. . . . . 6 ⊢ Fun |s
38		imadomg 10524	. . . . . 6 ⊢ ((𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ V → (Fun |s → ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ≼ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))))
39	34, 37, 38	mp2 9	. . . . 5 ⊢ ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ≼ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))
40		domfi 9171	. . . . 5 ⊢ (((𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥)) ∈ Fin ∧ ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ≼ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) → ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ∈ Fin)
41	28, 39, 40	sylancl 597	. . . 4 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( |s “ (𝒫 ∪ ( M “ 𝑥) × 𝒫 ∪ ( M “ 𝑥))) ∈ Fin)
42	8, 41	eqeltrd 2862	. . 3 ⊢ ((𝑥 ∈ ω ∧ ∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin) → ( M ‘𝑥) ∈ Fin)
43	42	ex 417	. 2 ⊢ (𝑥 ∈ ω → (∀𝑦 ∈ 𝑥 ( M ‘𝑦) ∈ Fin → ( M ‘𝑥) ∈ Fin))
44	2, 4, 43	omsinds 7881	1 ⊢ (𝐴 ∈ ω → ( M ‘𝐴) ∈ Fin)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078  Vcvv 3454   ⊆ wss 3904  𝒫 cpw 4561  ∪ cuni 4871   class class class wbr 5108   × cxp 5658  dom cdm 5660   “ cima 5663  Oncon0 6360  Fun wfun 6530  ⟶wf 6532  ‘cfv 6536  ωcom 7860   ≼ cdom 8939  Fincfn 8941   No csur 27815   <<s cslts 27961   |s ccuts 27963   M cmade 28026

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-ac2 10453

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-1o 8451  df-2o 8452  df-er 8692  df-map 8824  df-en 8942  df-dom 8943  df-fin 8945  df-card 9932  df-acn 9935  df-ac 10107  df-no 27818  df-lts 27819  df-bday 27820  df-slts 27962  df-cuts 27964  df-made 28031

This theorem is used by:  oldfi  28118