Theorem nnsf 13199

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 6339	. . . . . . 7 ⊢ 1o ∈ 2o
3	2	a1i 9	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 1o ∈ 2o)
4		nninff 13198	. . . . . . . 8 ⊢ (𝑝 ∈ ℕ∞ → 𝑝:ω⟶2o)
5	4	adantr 274	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 𝑝:ω⟶2o)
6		nnpredcl 4536	. . . . . . . 8 ⊢ (𝑖 ∈ ω → ∪ 𝑖 ∈ ω)
7	6	adantl 275	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → ∪ 𝑖 ∈ ω)
8	5, 7	ffvelrnd 5556	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → (𝑝‘∪ 𝑖) ∈ 2o)
9		nndceq0 4531	. . . . . . 7 ⊢ (𝑖 ∈ ω → DECID 𝑖 = ∅)
10	9	adantl 275	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → DECID 𝑖 = ∅)
11	3, 8, 10	ifcldcd 3507	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) ∈ 2o)
12		eqid 2139	. . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))
13	11, 12	fmptd 5574	. . . 4 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
14		2onn 6417	. . . . 5 ⊢ 2o ∈ ω
15		omex 4507	. . . . 5 ⊢ ω ∈ V
16		elmapg 6555	. . . . 5 ⊢ ((2o ∈ ω ∧ ω ∈ V) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o))
17	14, 15, 16	mp2an 422	. . . 4 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
18	13, 17	sylibr 133	. . 3 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω))
19		1on 6320	. . . . . . . . 9 ⊢ 1o ∈ On
20	19	ontrci 4349	. . . . . . . 8 ⊢ Tr 1o
21	2	a1i 9	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 1o ∈ 2o)
22	4	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑝:ω⟶2o)
23		peano2 4509	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
24	23	adantl 275	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → suc 𝑗 ∈ ω)
25		nnpredcl 4536	. . . . . . . . . . . . 13 ⊢ (suc 𝑗 ∈ ω → ∪ suc 𝑗 ∈ ω)
26	24, 25	syl 14	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ suc 𝑗 ∈ ω)
27	22, 26	ffvelrnd 5556	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ suc 𝑗) ∈ 2o)
28		nndceq0 4531	. . . . . . . . . . . 12 ⊢ (suc 𝑗 ∈ ω → DECID suc 𝑗 = ∅)
29	24, 28	syl 14	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID suc 𝑗 = ∅)
30	21, 27, 29	ifcldcd 3507	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
31	30	adantr 274	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
32		df-2o 6314	. . . . . . . . 9 ⊢ 2o = suc 1o
33	31, 32	eleqtrdi 2232	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ suc 1o)
34		trsucss 4345	. . . . . . . 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 3479	. . . . . . . 8 ⊢ (𝑗 = ∅ → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
37	36	adantl 275	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
38	35, 37	sseqtrrd 3136	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
39		simpr 109	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
40	39	adantr 274	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ∈ ω)
41		nnord 4525	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → Ord 𝑗)
42		ordtr 4300	. . . . . . . . . . 11 ⊢ (Ord 𝑗 → Tr 𝑗)
43	40, 41, 42	3syl 17	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → Tr 𝑗)
44		unisucg 4336	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
45	40, 44	syl 14	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
46	43, 45	mpbid 146	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ suc 𝑗 = 𝑗)
47	46	fveq2d 5425	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) = (𝑝‘𝑗))
48		simpr 109	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ 𝑗 = ∅)
49	48	neqned 2315	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ≠ ∅)
50		nnsucpred 4530	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ ω ∧ 𝑗 ≠ ∅) → suc ∪ 𝑗 = 𝑗)
51	40, 49, 50	syl2anc 408	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → suc ∪ 𝑗 = 𝑗)
52	51	fveq2d 5425	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) = (𝑝‘𝑗))
53		suceq 4324	. . . . . . . . . . . 12 ⊢ (𝑘 = ∪ 𝑗 → suc 𝑘 = suc ∪ 𝑗)
54	53	fveq2d 5425	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘suc 𝑘) = (𝑝‘suc ∪ 𝑗))
55		fveq2 5421	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘𝑘) = (𝑝‘∪ 𝑗))
56	54, 55	sseq12d 3128	. . . . . . . . . 10 ⊢ (𝑘 = ∪ 𝑗 → ((𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘) ↔ (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗)))
57		fveq1 5420	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘suc 𝑗) = (𝑝‘suc 𝑗))
58		fveq1 5420	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘𝑗) = (𝑝‘𝑗))
59	57, 58	sseq12d 3128	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑝 → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
60	59	ralbidv 2437	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑝 → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
61		df-nninf 7007	. . . . . . . . . . . . . 14 ⊢ ℕ∞ = {𝑓 ∈ (2o ↑𝑚 ω) ∣ ∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗)}
62	60, 61	elrab2 2843	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ ℕ∞ ↔ (𝑝 ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
63	62	simprbi 273	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗))
64		suceq 4324	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑘 → suc 𝑗 = suc 𝑘)
65	64	fveq2d 5425	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘suc 𝑗) = (𝑝‘suc 𝑘))
66		fveq2 5421	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘𝑗) = (𝑝‘𝑘))
67	65, 66	sseq12d 3128	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → ((𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘)))
68	67	cbvralv 2654	. . . . . . . . . . . 12 ⊢ (∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
69	63, 68	sylib 121	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
70	69	ad2antrr 479	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
71		nnpredcl 4536	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ω → ∪ 𝑗 ∈ ω)
72	71	adantl 275	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ 𝑗 ∈ ω)
73	72	adantr 274	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ 𝑗 ∈ ω)
74	56, 70, 73	rspcdva 2794	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗))
75	52, 74	eqsstrrd 3134	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘𝑗) ⊆ (𝑝‘∪ 𝑗))
76	47, 75	eqsstrd 3133	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) ⊆ (𝑝‘∪ 𝑗))
77		peano3 4510	. . . . . . . . . 10 ⊢ (𝑗 ∈ ω → suc 𝑗 ≠ ∅)
78	77	neneqd 2329	. . . . . . . . 9 ⊢ (𝑗 ∈ ω → ¬ suc 𝑗 = ∅)
79	78	ad2antlr 480	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ suc 𝑗 = ∅)
80	79	iffalsed 3484	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) = (𝑝‘∪ suc 𝑗))
81	48	iffalsed 3484	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = (𝑝‘∪ 𝑗))
82	76, 80, 81	3sstr4d 3142	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
83		nndceq0 4531	. . . . . . . 8 ⊢ (𝑗 ∈ ω → DECID 𝑗 = ∅)
84	83	adantl 275	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID 𝑗 = ∅)
85		exmiddc 821	. . . . . . 7 ⊢ (DECID 𝑗 = ∅ → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
86	84, 85	syl 14	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
87	38, 82, 86	mpjaodan 787	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
88		eqeq1 2146	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑖 = ∅ ↔ suc 𝑗 = ∅))
89		unieq 3745	. . . . . . . . 9 ⊢ (𝑖 = suc 𝑗 → ∪ 𝑖 = ∪ suc 𝑗)
90	89	fveq2d 5425	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ suc 𝑗))
91	88, 90	ifbieq2d 3496	. . . . . . 7 ⊢ (𝑖 = suc 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
92	91, 12	fvmptg 5497	. . . . . 6 ⊢ ((suc 𝑗 ∈ ω ∧ if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
93	24, 30, 92	syl2anc 408	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
94	22, 72	ffvelrnd 5556	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ 𝑗) ∈ 2o)
95	21, 94, 84	ifcldcd 3507	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o)
96		eqeq1 2146	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑖 = ∅ ↔ 𝑗 = ∅))
97		unieq 3745	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ∪ 𝑖 = ∪ 𝑗)
98	97	fveq2d 5425	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ 𝑗))
99	96, 98	ifbieq2d 3496	. . . . . . 7 ⊢ (𝑖 = 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
100	99, 12	fvmptg 5497	. . . . . 6 ⊢ ((𝑗 ∈ ω ∧ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
101	39, 95, 100	syl2anc 408	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
102	87, 93, 101	3sstr4d 3142	. . . 4 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
103	102	ralrimiva 2505	. . 3 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
104		fveq1 5420	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘suc 𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗))
105		fveq1 5420	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
106	104, 105	sseq12d 3128	. . . . 5 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
107	106	ralbidv 2437	. . . 4 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
108	107, 61	elrab2 2843	. . 3 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞ ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
109	18, 103, 108	sylanbrc 413	. 2 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞)
110	1, 109	fmpti 5572	1 ⊢ 𝑆:ℕ∞⟶ℕ∞

Syntax hints:  ¬ wn 3   ∧ wa 103   ↔ wb 104   ∨ wo 697  DECID wdc 819   = wceq 1331   ∈ wcel 1480   ≠ wne 2308  ∀wral 2416  Vcvv 2686   ⊆ wss 3071  ∅c0 3363  ifcif 3474  ∪ cuni 3736   ↦ cmpt 3989  Tr wtr 4026  Ord word 4284  suc csuc 4287  ωcom 4504  ⟶wf 5119  ‘cfv 5123  (class class class)co 5774  1_oc1o 6306  2_oc2o 6307   ↑_𝑚 cmap 6542  ℕ_∞xnninf 7005

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1o 6313  df-2o 6314  df-map 6544  df-nninf 7007

This theorem is referenced by:  peano4nninf  13200