Theorem noseqrdgfn 28312

Description: The recursive definition generator on surreal sequences is a function. (Contributed by Scott Fenton, 18-Apr-2025.)

Hypotheses

Ref	Expression
om2noseq.1	⊢ (𝜑 → 𝐶 ∈ No )
om2noseq.2	⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
om2noseq.3	⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
noseqrdg.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
noseqrdg.2	⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
noseqrdg.3	⊢ (𝜑 → 𝑆 = ran 𝑅)

Assertion

Ref	Expression
noseqrdgfn	⊢ (𝜑 → 𝑆 Fn 𝑍)

Distinct variable groups:   𝑥,𝐶   𝑥,𝐹,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦)   𝐶(𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐺(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑍(𝑥,𝑦)

Proof of Theorem noseqrdgfn

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

Step	Hyp	Ref	Expression
1		noseqrdg.3	. . . . . . . 8 ⊢ (𝜑 → 𝑆 = ran 𝑅)
2	1	eleq2d 2827	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ 𝑆 ↔ 𝑧 ∈ ran 𝑅))
3		frfnom 8475	. . . . . . . . 9 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω
4		noseqrdg.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
5	4	fneq1d 6661	. . . . . . . . 9 ⊢ (𝜑 → (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω) Fn ω))
6	3, 5	mpbiri 258	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn ω)
7		fvelrnb 6969	. . . . . . . 8 ⊢ (𝑅 Fn ω → (𝑧 ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = 𝑧))
8	6, 7	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = 𝑧))
9	2, 8	bitrd 279	. . . . . 6 ⊢ (𝜑 → (𝑧 ∈ 𝑆 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = 𝑧))
10		om2noseq.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ No )
11		om2noseq.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
12		om2noseq.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
13		noseqrdg.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
14	10, 11, 12, 13, 4	om2noseqrdg 28310	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝑅‘𝑤) = ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩)
15	10, 11, 12	om2noseqfo 28304	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺:ω–onto→𝑍)
16		fof 6820	. . . . . . . . . . . 12 ⊢ (𝐺:ω–onto→𝑍 → 𝐺:ω⟶𝑍)
17	15, 16	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:ω⟶𝑍)
18	17	ffvelcdmda 7104	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝐺‘𝑤) ∈ 𝑍)
19		fvex 6919	. . . . . . . . . 10 ⊢ (2nd ‘(𝑅‘𝑤)) ∈ V
20		opelxpi 5722	. . . . . . . . . 10 ⊢ (((𝐺‘𝑤) ∈ 𝑍 ∧ (2nd ‘(𝑅‘𝑤)) ∈ V) → ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ ∈ (𝑍 × V))
21	18, 19, 20	sylancl 586	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ ∈ (𝑍 × V))
22	14, 21	eqeltrd 2841	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → (𝑅‘𝑤) ∈ (𝑍 × V))
23		eleq1 2829	. . . . . . . 8 ⊢ ((𝑅‘𝑤) = 𝑧 → ((𝑅‘𝑤) ∈ (𝑍 × V) ↔ 𝑧 ∈ (𝑍 × V)))
24	22, 23	syl5ibcom 245	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = 𝑧 → 𝑧 ∈ (𝑍 × V)))
25	24	rexlimdva 3155	. . . . . 6 ⊢ (𝜑 → (∃𝑤 ∈ ω (𝑅‘𝑤) = 𝑧 → 𝑧 ∈ (𝑍 × V)))
26	9, 25	sylbid 240	. . . . 5 ⊢ (𝜑 → (𝑧 ∈ 𝑆 → 𝑧 ∈ (𝑍 × V)))
27	26	ssrdv 3989	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝑍 × V))
28		relxp 5703	. . . 4 ⊢ Rel (𝑍 × V)
29		relss 5791	. . . 4 ⊢ (𝑆 ⊆ (𝑍 × V) → (Rel (𝑍 × V) → Rel 𝑆))
30	27, 28, 29	mpisyl 21	. . 3 ⊢ (𝜑 → Rel 𝑆)
31	1	eleq2d 2827	. . . . . . . 8 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ 𝑆 ↔ ⟨𝑣, 𝑧⟩ ∈ ran 𝑅))
32		fvelrnb 6969	. . . . . . . . 9 ⊢ (𝑅 Fn ω → (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩))
33	6, 32	syl 17	. . . . . . . 8 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ ran 𝑅 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩))
34	31, 33	bitrd 279	. . . . . . 7 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ 𝑆 ↔ ∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩))
35	14	eqeq1d 2739	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ ↔ ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩))
36	35	biimpd 229	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩))
37	36	impr 454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → ⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩)
38		fvex 6919	. . . . . . . . . . . . . 14 ⊢ (𝐺‘𝑤) ∈ V
39	38, 19	opth1 5480	. . . . . . . . . . . . 13 ⊢ (⟨(𝐺‘𝑤), (2nd ‘(𝑅‘𝑤))⟩ = ⟨𝑣, 𝑧⟩ → (𝐺‘𝑤) = 𝑣)
40	37, 39	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → (𝐺‘𝑤) = 𝑣)
41	10, 11, 12	om2noseqf1o 28307	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺:ω–1-1-onto→𝑍)
42		f1ocnvfv 7298	. . . . . . . . . . . . . 14 ⊢ ((𝐺:ω–1-1-onto→𝑍 ∧ 𝑤 ∈ ω) → ((𝐺‘𝑤) = 𝑣 → (◡𝐺‘𝑣) = 𝑤))
43	41, 42	sylan 580	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ ω) → ((𝐺‘𝑤) = 𝑣 → (◡𝐺‘𝑣) = 𝑤))
44	43	adantrr 717	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → ((𝐺‘𝑤) = 𝑣 → (◡𝐺‘𝑣) = 𝑤))
45	40, 44	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → (◡𝐺‘𝑣) = 𝑤)
46	45	fveq2d 6910	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → (𝑅‘(◡𝐺‘𝑣)) = (𝑅‘𝑤))
47	46	fveq2d 6910	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → (2nd ‘(𝑅‘(◡𝐺‘𝑣))) = (2nd ‘(𝑅‘𝑤)))
48		vex 3484	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
49		vex 3484	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
50	48, 49	op2ndd 8025	. . . . . . . . . 10 ⊢ ((𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → (2nd ‘(𝑅‘𝑤)) = 𝑧)
51	50	ad2antll 729	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → (2nd ‘(𝑅‘𝑤)) = 𝑧)
52	47, 51	eqtr2d 2778	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 ∈ ω ∧ (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩)) → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))
53	52	rexlimdvaa 3156	. . . . . . 7 ⊢ (𝜑 → (∃𝑤 ∈ ω (𝑅‘𝑤) = ⟨𝑣, 𝑧⟩ → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
54	34, 53	sylbid 240	. . . . . 6 ⊢ (𝜑 → (⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
55	54	alrimiv 1927	. . . . 5 ⊢ (𝜑 → ∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
56		fvex 6919	. . . . . 6 ⊢ (2nd ‘(𝑅‘(◡𝐺‘𝑣))) ∈ V
57		eqeq2 2749	. . . . . . . 8 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → (𝑧 = 𝑤 ↔ 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))))
58	57	imbi2d 340	. . . . . . 7 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → ((⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤) ↔ (⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))))
59	58	albidv 1920	. . . . . 6 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))) → (∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤) ↔ ∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣))))))
60	56, 59	spcev 3606	. . . . 5 ⊢ (∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = (2nd ‘(𝑅‘(◡𝐺‘𝑣)))) → ∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤))
61	55, 60	syl 17	. . . 4 ⊢ (𝜑 → ∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤))
62	61	alrimiv 1927	. . 3 ⊢ (𝜑 → ∀𝑣∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤))
63		dffun5 6578	. . 3 ⊢ (Fun 𝑆 ↔ (Rel 𝑆 ∧ ∀𝑣∃𝑤∀𝑧(⟨𝑣, 𝑧⟩ ∈ 𝑆 → 𝑧 = 𝑤)))
64	30, 62, 63	sylanbrc 583	. 2 ⊢ (𝜑 → Fun 𝑆)
65		dmss 5913	. . . . 5 ⊢ (𝑆 ⊆ (𝑍 × V) → dom 𝑆 ⊆ dom (𝑍 × V))
66	27, 65	syl 17	. . . 4 ⊢ (𝜑 → dom 𝑆 ⊆ dom (𝑍 × V))
67		dmxpss 6191	. . . 4 ⊢ dom (𝑍 × V) ⊆ 𝑍
68	66, 67	sstrdi 3996	. . 3 ⊢ (𝜑 → dom 𝑆 ⊆ 𝑍)
69	10, 11, 12, 13, 4	noseqrdglem 28311	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑍) → ⟨𝑣, (2nd ‘(𝑅‘(◡𝐺‘𝑣)))⟩ ∈ ran 𝑅)
70	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑍) → 𝑆 = ran 𝑅)
71	69, 70	eleqtrrd 2844	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑍) → ⟨𝑣, (2nd ‘(𝑅‘(◡𝐺‘𝑣)))⟩ ∈ 𝑆)
72	48, 56	opeldm 5918	. . . 4 ⊢ (⟨𝑣, (2nd ‘(𝑅‘(◡𝐺‘𝑣)))⟩ ∈ 𝑆 → 𝑣 ∈ dom 𝑆)
73	71, 72	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑍) → 𝑣 ∈ dom 𝑆)
74	68, 73	eqelssd 4005	. 2 ⊢ (𝜑 → dom 𝑆 = 𝑍)
75		df-fn 6564	. 2 ⊢ (𝑆 Fn 𝑍 ↔ (Fun 𝑆 ∧ dom 𝑆 = 𝑍))
76	64, 74, 75	sylanbrc 583	1 ⊢ (𝜑 → 𝑆 Fn 𝑍)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   = wceq 1540  ∃wex 1779   ∈ wcel 2108  ∃wrex 3070  Vcvv 3480   ⊆ wss 3951  ⟨cop 4632   ↦ cmpt 5225   × cxp 5683  ^◡ccnv 5684  dom cdm 5685  ran crn 5686   ↾ cres 5687   “ cima 5688  Rel wrel 5690  Fun wfun 6555   Fn wfn 6556  ⟶wf 6557  –onto→wfo 6559  –1-1-onto→wf1o 6560  ‘cfv 6561  (class class class)co 7431   ∈ cmpo 7433  ωcom 7887  2^nd c2nd 8013  reccrdg 8449   No csur 27684   1_s c1s 27868   +_s cadds 27992

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-tp 4631  df-op 4633  df-ot 4635  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-2o 8507  df-oadd 8510  df-nadd 8704  df-no 27687  df-slt 27688  df-bday 27689  df-sle 27790  df-sslt 27826  df-scut 27828  df-0s 27869  df-1s 27870  df-made 27886  df-old 27887  df-left 27889  df-right 27890  df-norec2 27982  df-adds 27993

This theorem is referenced by:  noseqrdg0  28313  noseqrdgsuc  28314  seqsfn  28315