Theorem madef 28066

Description: The made function is a function from ordinals to sets of surreals. (Contributed by Scott Fenton, 6-Aug-2024.)

Assertion

Ref	Expression
madef	⊢ M :On⟶𝒫 No

Proof of Theorem madef

Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-made 28057	. . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2	1	tfr1 8393	. 2 ⊢ M Fn On
3		madeval2 28063	. . . . . . 7 ⊢ (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)})
4		ssrab2 4037	. . . . . . 7 ⊢ {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No
5	3, 4	eqsstrdi 3984	. . . . . 6 ⊢ (𝑥 ∈ On → ( M ‘𝑥) ⊆ No )
6		sseq1 3965	. . . . . 6 ⊢ (𝑦 = ( M ‘𝑥) → (𝑦 ⊆ No ↔ ( M ‘𝑥) ⊆ No ))
7	5, 6	syl5ibrcom 250	. . . . 5 ⊢ (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No ))
8	7	rexlimiv 3162	. . . 4 ⊢ (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No )
9		vex 3462	. . . . 5 ⊢ 𝑦 ∈ V
10		eqeq1 2770	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥)))
11	10	rexbidv 3192	. . . . 5 ⊢ (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)))
12		fnrnfv 6947	. . . . . 6 ⊢ ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)})
13	2, 12	ax-mp 5	. . . . 5 ⊢ ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}
14	9, 11, 13	elab2 3644	. . . 4 ⊢ (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))
15		velpw 4572	. . . 4 ⊢ (𝑦 ∈ 𝒫 No ↔ 𝑦 ⊆ No )
16	8, 14, 15	3imtr4i 295	. . 3 ⊢ (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No )
17	16	ssriv 3944	. 2 ⊢ ran M ⊆ 𝒫 No
18		df-f 6547	. 2 ⊢ ( M :On⟶𝒫 No ↔ ( M Fn On ∧ ran M ⊆ 𝒫 No ))
19	2, 17, 18	mpbir2an 724	1 ⊢ M :On⟶𝒫 No

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {cab 2744  ∃wrex 3092  {crab 3419  Vcvv 3458   ⊆ wss 3908  𝒫 cpw 4567  ∪ cuni 4877   class class class wbr 5114   ↦ cmpt 5197   × cxp 5664  ran crn 5667   “ cima 5669  Oncon0 6367   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423   No csur 27841   <<s cslts 27987   |s ccuts 27989   M cmade 28052

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-1o 8462  df-2o 8463  df-no 27844  df-lts 27845  df-bday 27846  df-slts 27988  df-cuts 27990  df-made 28057

This theorem is used by:  oldf  28067  newf  28068  madessno  28070  elmade  28087  elold  28089  old1  28095  madess  28096  madeoldsuc  28115  madebdayim  28118  madefi  28143  oldfi  28144  oldfib  28607