Theorem madef 28109

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 28100	. . 3 ⊢ M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2	1	tfr1 8390	. 2 ⊢ M Fn On
3		madeval2 28106	. . . . . . 7 ⊢ (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)})
4		ssrab2 4031	. . . . . . 7 ⊢ {𝑦 ∈ No ∣ ∃𝑧 ∈ 𝒫 ∪ ( M “ 𝑥)∃𝑤 ∈ 𝒫 ∪ ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No
5	3, 4	eqsstrdi 3978	. . . . . 6 ⊢ (𝑥 ∈ On → ( M ‘𝑥) ⊆ No )
6		sseq1 3959	. . . . . 6 ⊢ (𝑦 = ( M ‘𝑥) → (𝑦 ⊆ No ↔ ( M ‘𝑥) ⊆ No ))
7	5, 6	syl5ibrcom 250	. . . . 5 ⊢ (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No ))
8	7	rexlimiv 3158	. . . 4 ⊢ (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 ⊆ No )
9		vex 3457	. . . . 5 ⊢ 𝑦 ∈ V
10		eqeq1 2766	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥)))
11	10	rexbidv 3188	. . . . 5 ⊢ (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)))
12		fnrnfv 6941	. . . . . 6 ⊢ ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)})
13	2, 12	ax-mp 5	. . . . 5 ⊢ ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}
14	9, 11, 13	elab2 3639	. . . 4 ⊢ (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))
15		velpw 4565	. . . 4 ⊢ (𝑦 ∈ 𝒫 No ↔ 𝑦 ⊆ No )
16	8, 14, 15	3imtr4i 295	. . 3 ⊢ (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No )
17	16	ssriv 3938	. 2 ⊢ ran M ⊆ 𝒫 No
18		df-f 6541	. 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 2145  {cab 2740  ∃wrex 3088  {crab 3414  Vcvv 3453   ⊆ wss 3902  𝒫 cpw 4560  ∪ cuni 4870   class class class wbr 5107   ↦ cmpt 5190   × cxp 5657  ran crn 5660   “ cima 5662  Oncon0 6361   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7417   No csur 27884   <<s cslts 28030   |s ccuts 28032   M cmade 28095

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 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 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-no 27887  df-lts 27888  df-bday 27889  df-slts 28031  df-cuts 28033  df-made 28100

This theorem is used by:  oldf  28110  newf  28111  madessno  28113  elmade  28130  elold  28132  old1  28138  madess  28139  madeoldsuc  28158  madebdayim  28161  madefi  28186  oldfi  28187  oldfib  28650