Theorem nnsf 13374

Description: Domain and range of 𝑆. Part of Definition 3.3 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 30-Jul-2022.)

Hypothesis

Ref	Expression
nns.s	⊢ 𝑆 = (𝑝 ∈ ℕ∞ ↦ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))))

Assertion

Ref	Expression
nnsf	⊢ 𝑆:ℕ∞⟶ℕ∞

Distinct variable group:   𝑖,𝑝

Allowed substitution hints:   𝑆(𝑖,𝑝)

Proof of Theorem nnsf

Dummy variables 𝑓 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nns.s	. 2 ⊢ 𝑆 = (𝑝 ∈ ℕ∞ ↦ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))))
2		1lt2o 6347	. . . . . . 7 ⊢ 1o ∈ 2o
3	2	a1i 9	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 1o ∈ 2o)
4		nninff 13373	. . . . . . . 8 ⊢ (𝑝 ∈ ℕ∞ → 𝑝:ω⟶2o)
5	4	adantr 274	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 𝑝:ω⟶2o)
6		nnpredcl 4544	. . . . . . . 8 ⊢ (𝑖 ∈ ω → ∪ 𝑖 ∈ ω)
7	6	adantl 275	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → ∪ 𝑖 ∈ ω)
8	5, 7	ffvelrnd 5564	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → (𝑝‘∪ 𝑖) ∈ 2o)
9		nndceq0 4539	. . . . . . 7 ⊢ (𝑖 ∈ ω → DECID 𝑖 = ∅)
10	9	adantl 275	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → DECID 𝑖 = ∅)
11	3, 8, 10	ifcldcd 3512	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) ∈ 2o)
12		eqid 2140	. . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))
13	11, 12	fmptd 5582	. . . 4 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
14		2onn 6425	. . . . 5 ⊢ 2o ∈ ω
15		omex 4515	. . . . 5 ⊢ ω ∈ V
16		elmapg 6563	. . . . 5 ⊢ ((2o ∈ ω ∧ ω ∈ V) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o))
17	14, 15, 16	mp2an 423	. . . 4 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
18	13, 17	sylibr 133	. . 3 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω))
19		1on 6328	. . . . . . . . 9 ⊢ 1o ∈ On
20	19	ontrci 4357	. . . . . . . 8 ⊢ Tr 1o
21	2	a1i 9	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 1o ∈ 2o)
22	4	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑝:ω⟶2o)
23		peano2 4517	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
24	23	adantl 275	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → suc 𝑗 ∈ ω)
25		nnpredcl 4544	. . . . . . . . . . . . 13 ⊢ (suc 𝑗 ∈ ω → ∪ suc 𝑗 ∈ ω)
26	24, 25	syl 14	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ suc 𝑗 ∈ ω)
27	22, 26	ffvelrnd 5564	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ suc 𝑗) ∈ 2o)
28		nndceq0 4539	. . . . . . . . . . . 12 ⊢ (suc 𝑗 ∈ ω → DECID suc 𝑗 = ∅)
29	24, 28	syl 14	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID suc 𝑗 = ∅)
30	21, 27, 29	ifcldcd 3512	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
31	30	adantr 274	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
32		df-2o 6322	. . . . . . . . 9 ⊢ 2o = suc 1o
33	31, 32	eleqtrdi 2233	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ suc 1o)
34		trsucss 4353	. . . . . . . 8 ⊢ (Tr 1o → (if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ suc 1o → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ 1o))
35	20, 33, 34	mpsyl 65	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ 1o)
36		iftrue 3484	. . . . . . . 8 ⊢ (𝑗 = ∅ → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
37	36	adantl 275	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
38	35, 37	sseqtrrd 3141	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
39		simpr 109	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
40	39	adantr 274	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ∈ ω)
41		nnord 4533	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → Ord 𝑗)
42		ordtr 4308	. . . . . . . . . . 11 ⊢ (Ord 𝑗 → Tr 𝑗)
43	40, 41, 42	3syl 17	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → Tr 𝑗)
44		unisucg 4344	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
45	40, 44	syl 14	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
46	43, 45	mpbid 146	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ suc 𝑗 = 𝑗)
47	46	fveq2d 5433	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) = (𝑝‘𝑗))
48		simpr 109	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ 𝑗 = ∅)
49	48	neqned 2316	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ≠ ∅)
50		nnsucpred 4538	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ ω ∧ 𝑗 ≠ ∅) → suc ∪ 𝑗 = 𝑗)
51	40, 49, 50	syl2anc 409	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → suc ∪ 𝑗 = 𝑗)
52	51	fveq2d 5433	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) = (𝑝‘𝑗))
53		suceq 4332	. . . . . . . . . . . 12 ⊢ (𝑘 = ∪ 𝑗 → suc 𝑘 = suc ∪ 𝑗)
54	53	fveq2d 5433	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘suc 𝑘) = (𝑝‘suc ∪ 𝑗))
55		fveq2 5429	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘𝑘) = (𝑝‘∪ 𝑗))
56	54, 55	sseq12d 3133	. . . . . . . . . 10 ⊢ (𝑘 = ∪ 𝑗 → ((𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘) ↔ (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗)))
57		fveq1 5428	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘suc 𝑗) = (𝑝‘suc 𝑗))
58		fveq1 5428	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘𝑗) = (𝑝‘𝑗))
59	57, 58	sseq12d 3133	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑝 → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
60	59	ralbidv 2438	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑝 → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
61		df-nninf 7015	. . . . . . . . . . . . . 14 ⊢ ℕ∞ = {𝑓 ∈ (2o ↑𝑚 ω) ∣ ∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗)}
62	60, 61	elrab2 2847	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ ℕ∞ ↔ (𝑝 ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
63	62	simprbi 273	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗))
64		suceq 4332	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑘 → suc 𝑗 = suc 𝑘)
65	64	fveq2d 5433	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘suc 𝑗) = (𝑝‘suc 𝑘))
66		fveq2 5429	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘𝑗) = (𝑝‘𝑘))
67	65, 66	sseq12d 3133	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → ((𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘)))
68	67	cbvralv 2657	. . . . . . . . . . . 12 ⊢ (∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
69	63, 68	sylib 121	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
70	69	ad2antrr 480	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
71		nnpredcl 4544	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ω → ∪ 𝑗 ∈ ω)
72	71	adantl 275	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ 𝑗 ∈ ω)
73	72	adantr 274	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ 𝑗 ∈ ω)
74	56, 70, 73	rspcdva 2798	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗))
75	52, 74	eqsstrrd 3139	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘𝑗) ⊆ (𝑝‘∪ 𝑗))
76	47, 75	eqsstrd 3138	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) ⊆ (𝑝‘∪ 𝑗))
77		peano3 4518	. . . . . . . . . 10 ⊢ (𝑗 ∈ ω → suc 𝑗 ≠ ∅)
78	77	neneqd 2330	. . . . . . . . 9 ⊢ (𝑗 ∈ ω → ¬ suc 𝑗 = ∅)
79	78	ad2antlr 481	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ suc 𝑗 = ∅)
80	79	iffalsed 3489	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) = (𝑝‘∪ suc 𝑗))
81	48	iffalsed 3489	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = (𝑝‘∪ 𝑗))
82	76, 80, 81	3sstr4d 3147	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
83		nndceq0 4539	. . . . . . . 8 ⊢ (𝑗 ∈ ω → DECID 𝑗 = ∅)
84	83	adantl 275	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID 𝑗 = ∅)
85		exmiddc 822	. . . . . . 7 ⊢ (DECID 𝑗 = ∅ → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
86	84, 85	syl 14	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
87	38, 82, 86	mpjaodan 788	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
88		eqeq1 2147	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑖 = ∅ ↔ suc 𝑗 = ∅))
89		unieq 3753	. . . . . . . . 9 ⊢ (𝑖 = suc 𝑗 → ∪ 𝑖 = ∪ suc 𝑗)
90	89	fveq2d 5433	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ suc 𝑗))
91	88, 90	ifbieq2d 3501	. . . . . . 7 ⊢ (𝑖 = suc 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
92	91, 12	fvmptg 5505	. . . . . 6 ⊢ ((suc 𝑗 ∈ ω ∧ if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
93	24, 30, 92	syl2anc 409	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
94	22, 72	ffvelrnd 5564	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ 𝑗) ∈ 2o)
95	21, 94, 84	ifcldcd 3512	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o)
96		eqeq1 2147	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑖 = ∅ ↔ 𝑗 = ∅))
97		unieq 3753	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ∪ 𝑖 = ∪ 𝑗)
98	97	fveq2d 5433	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ 𝑗))
99	96, 98	ifbieq2d 3501	. . . . . . 7 ⊢ (𝑖 = 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
100	99, 12	fvmptg 5505	. . . . . 6 ⊢ ((𝑗 ∈ ω ∧ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
101	39, 95, 100	syl2anc 409	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
102	87, 93, 101	3sstr4d 3147	. . . 4 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
103	102	ralrimiva 2508	. . 3 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
104		fveq1 5428	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘suc 𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗))
105		fveq1 5428	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
106	104, 105	sseq12d 3133	. . . . 5 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
107	106	ralbidv 2438	. . . 4 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
108	107, 61	elrab2 2847	. . 3 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞ ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
109	18, 103, 108	sylanbrc 414	. 2 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞)
110	1, 109	fmpti 5580	1 ⊢ 𝑆:ℕ∞⟶ℕ∞

Syntax hints:  ¬ wn 3   ∧ wa 103   ↔ wb 104   ∨ wo 698  DECID wdc 820   = wceq 1332   ∈ wcel 1481   ≠ wne 2309  ∀wral 2417  Vcvv 2689   ⊆ wss 3076  ∅c0 3368  ifcif 3479  ∪ cuni 3744   ↦ cmpt 3997  Tr wtr 4034  Ord word 4292  suc csuc 4295  ωcom 4512  ⟶wf 5127  ‘cfv 5131  (class class class)co 5782  1_oc1o 6314  2_oc2o 6315   ↑_𝑚 cmap 6550  ℕ_∞xnninf 7013

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-if 3480  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1o 6321  df-2o 6322  df-map 6552  df-nninf 7015

This theorem is referenced by:  peano4nninf  13375