Theorem nnsf 15495

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 6495	. . . . . . 7 ⊢ 1o ∈ 2o
3	2	a1i 9	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 1o ∈ 2o)
4		nninff 7181	. . . . . . . 8 ⊢ (𝑝 ∈ ℕ∞ → 𝑝:ω⟶2o)
5	4	adantr 276	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → 𝑝:ω⟶2o)
6		nnpredcl 4655	. . . . . . . 8 ⊢ (𝑖 ∈ ω → ∪ 𝑖 ∈ ω)
7	6	adantl 277	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → ∪ 𝑖 ∈ ω)
8	5, 7	ffvelcdmd 5694	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → (𝑝‘∪ 𝑖) ∈ 2o)
9		nndceq0 4650	. . . . . . 7 ⊢ (𝑖 ∈ ω → DECID 𝑖 = ∅)
10	9	adantl 277	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → DECID 𝑖 = ∅)
11	3, 8, 10	ifcldcd 3593	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑖 ∈ ω) → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) ∈ 2o)
12		eqid 2193	. . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))
13	11, 12	fmptd 5712	. . . 4 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
14		2onn 6574	. . . . 5 ⊢ 2o ∈ ω
15		omex 4625	. . . . 5 ⊢ ω ∈ V
16		elmapg 6715	. . . . 5 ⊢ ((2o ∈ ω ∧ ω ∈ V) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o))
17	14, 15, 16	mp2an 426	. . . 4 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ↔ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))):ω⟶2o)
18	13, 17	sylibr 134	. . 3 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω))
19		1on 6476	. . . . . . . . 9 ⊢ 1o ∈ On
20	19	ontrci 4458	. . . . . . . 8 ⊢ Tr 1o
21	2	a1i 9	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 1o ∈ 2o)
22	4	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑝:ω⟶2o)
23		peano2 4627	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
24	23	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → suc 𝑗 ∈ ω)
25		nnpredcl 4655	. . . . . . . . . . . . 13 ⊢ (suc 𝑗 ∈ ω → ∪ suc 𝑗 ∈ ω)
26	24, 25	syl 14	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ suc 𝑗 ∈ ω)
27	22, 26	ffvelcdmd 5694	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ suc 𝑗) ∈ 2o)
28		nndceq0 4650	. . . . . . . . . . . 12 ⊢ (suc 𝑗 ∈ ω → DECID suc 𝑗 = ∅)
29	24, 28	syl 14	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID suc 𝑗 = ∅)
30	21, 27, 29	ifcldcd 3593	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
31	30	adantr 276	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o)
32		df-2o 6470	. . . . . . . . 9 ⊢ 2o = suc 1o
33	31, 32	eleqtrdi 2286	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ suc 1o)
34		trsucss 4454	. . . . . . . 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 3562	. . . . . . . 8 ⊢ (𝑗 = ∅ → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
37	36	adantl 277	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = 1o)
38	35, 37	sseqtrrd 3218	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
39		simpr 110	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
40	39	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ∈ ω)
41		nnord 4644	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → Ord 𝑗)
42		ordtr 4409	. . . . . . . . . . 11 ⊢ (Ord 𝑗 → Tr 𝑗)
43	40, 41, 42	3syl 17	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → Tr 𝑗)
44		unisucg 4445	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ω → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
45	40, 44	syl 14	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (Tr 𝑗 ↔ ∪ suc 𝑗 = 𝑗))
46	43, 45	mpbid 147	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ suc 𝑗 = 𝑗)
47	46	fveq2d 5558	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) = (𝑝‘𝑗))
48		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ 𝑗 = ∅)
49	48	neqned 2371	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → 𝑗 ≠ ∅)
50		nnsucpred 4649	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ ω ∧ 𝑗 ≠ ∅) → suc ∪ 𝑗 = 𝑗)
51	40, 49, 50	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → suc ∪ 𝑗 = 𝑗)
52	51	fveq2d 5558	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) = (𝑝‘𝑗))
53		suceq 4433	. . . . . . . . . . . 12 ⊢ (𝑘 = ∪ 𝑗 → suc 𝑘 = suc ∪ 𝑗)
54	53	fveq2d 5558	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘suc 𝑘) = (𝑝‘suc ∪ 𝑗))
55		fveq2 5554	. . . . . . . . . . 11 ⊢ (𝑘 = ∪ 𝑗 → (𝑝‘𝑘) = (𝑝‘∪ 𝑗))
56	54, 55	sseq12d 3210	. . . . . . . . . 10 ⊢ (𝑘 = ∪ 𝑗 → ((𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘) ↔ (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗)))
57		fveq1 5553	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘suc 𝑗) = (𝑝‘suc 𝑗))
58		fveq1 5553	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑝 → (𝑓‘𝑗) = (𝑝‘𝑗))
59	57, 58	sseq12d 3210	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑝 → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
60	59	ralbidv 2494	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑝 → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
61		df-nninf 7179	. . . . . . . . . . . . . 14 ⊢ ℕ∞ = {𝑓 ∈ (2o ↑𝑚 ω) ∣ ∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗)}
62	60, 61	elrab2 2919	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ ℕ∞ ↔ (𝑝 ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗)))
63	62	simprbi 275	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗))
64		suceq 4433	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑘 → suc 𝑗 = suc 𝑘)
65	64	fveq2d 5558	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘suc 𝑗) = (𝑝‘suc 𝑘))
66		fveq2 5554	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑘 → (𝑝‘𝑗) = (𝑝‘𝑘))
67	65, 66	sseq12d 3210	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑘 → ((𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘)))
68	67	cbvralv 2726	. . . . . . . . . . . 12 ⊢ (∀𝑗 ∈ ω (𝑝‘suc 𝑗) ⊆ (𝑝‘𝑗) ↔ ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
69	63, 68	sylib 122	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
70	69	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∀𝑘 ∈ ω (𝑝‘suc 𝑘) ⊆ (𝑝‘𝑘))
71		nnpredcl 4655	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ω → ∪ 𝑗 ∈ ω)
72	71	adantl 277	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ∪ 𝑗 ∈ ω)
73	72	adantr 276	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ∪ 𝑗 ∈ ω)
74	56, 70, 73	rspcdva 2869	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘suc ∪ 𝑗) ⊆ (𝑝‘∪ 𝑗))
75	52, 74	eqsstrrd 3216	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘𝑗) ⊆ (𝑝‘∪ 𝑗))
76	47, 75	eqsstrd 3215	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → (𝑝‘∪ suc 𝑗) ⊆ (𝑝‘∪ 𝑗))
77		peano3 4628	. . . . . . . . . 10 ⊢ (𝑗 ∈ ω → suc 𝑗 ≠ ∅)
78	77	neneqd 2385	. . . . . . . . 9 ⊢ (𝑗 ∈ ω → ¬ suc 𝑗 = ∅)
79	78	ad2antlr 489	. . . . . . . 8 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → ¬ suc 𝑗 = ∅)
80	79	iffalsed 3567	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) = (𝑝‘∪ suc 𝑗))
81	48	iffalsed 3567	. . . . . . 7 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) = (𝑝‘∪ 𝑗))
82	76, 80, 81	3sstr4d 3224	. . . . . 6 ⊢ (((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) ∧ ¬ 𝑗 = ∅) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
83		nndceq0 4650	. . . . . . . 8 ⊢ (𝑗 ∈ ω → DECID 𝑗 = ∅)
84	83	adantl 277	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → DECID 𝑗 = ∅)
85		exmiddc 837	. . . . . . 7 ⊢ (DECID 𝑗 = ∅ → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
86	84, 85	syl 14	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑗 = ∅ ∨ ¬ 𝑗 = ∅))
87	38, 82, 86	mpjaodan 799	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ⊆ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
88		eqeq1 2200	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑖 = ∅ ↔ suc 𝑗 = ∅))
89		unieq 3844	. . . . . . . . 9 ⊢ (𝑖 = suc 𝑗 → ∪ 𝑖 = ∪ suc 𝑗)
90	89	fveq2d 5558	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ suc 𝑗))
91	88, 90	ifbieq2d 3581	. . . . . . 7 ⊢ (𝑖 = suc 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
92	91, 12	fvmptg 5633	. . . . . 6 ⊢ ((suc 𝑗 ∈ ω ∧ if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
93	24, 30, 92	syl2anc 411	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) = if(suc 𝑗 = ∅, 1o, (𝑝‘∪ suc 𝑗)))
94	22, 72	ffvelcdmd 5694	. . . . . . 7 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → (𝑝‘∪ 𝑗) ∈ 2o)
95	21, 94, 84	ifcldcd 3593	. . . . . 6 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o)
96		eqeq1 2200	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑖 = ∅ ↔ 𝑗 = ∅))
97		unieq 3844	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ∪ 𝑖 = ∪ 𝑗)
98	97	fveq2d 5558	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑝‘∪ 𝑖) = (𝑝‘∪ 𝑗))
99	96, 98	ifbieq2d 3581	. . . . . . 7 ⊢ (𝑖 = 𝑗 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
100	99, 12	fvmptg 5633	. . . . . 6 ⊢ ((𝑗 ∈ ω ∧ if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)) ∈ 2o) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
101	39, 95, 100	syl2anc 411	. . . . 5 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗) = if(𝑗 = ∅, 1o, (𝑝‘∪ 𝑗)))
102	87, 93, 101	3sstr4d 3224	. . . 4 ⊢ ((𝑝 ∈ ℕ∞ ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
103	102	ralrimiva 2567	. . 3 ⊢ (𝑝 ∈ ℕ∞ → ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
104		fveq1 5553	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘suc 𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗))
105		fveq1 5553	. . . . . 6 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (𝑓‘𝑗) = ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗))
106	104, 105	sseq12d 3210	. . . . 5 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
107	106	ralbidv 2494	. . . 4 ⊢ (𝑓 = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
108	107, 61	elrab2 2919	. . 3 ⊢ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞ ↔ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘suc 𝑗) ⊆ ((𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)))‘𝑗)))
109	18, 103, 108	sylanbrc 417	. 2 ⊢ (𝑝 ∈ ℕ∞ → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) ∈ ℕ∞)
110	1, 109	fmpti 5710	1 ⊢ 𝑆:ℕ∞⟶ℕ∞

Syntax hints:  ¬ wn 3   ∧ wa 104   ↔ wb 105   ∨ wo 709  DECID wdc 835   = wceq 1364   ∈ wcel 2164   ≠ wne 2364  ∀wral 2472  Vcvv 2760   ⊆ wss 3153  ∅c0 3446  ifcif 3557  ∪ cuni 3835   ↦ cmpt 4090  Tr wtr 4127  Ord word 4393  suc csuc 4396  ωcom 4622  ⟶wf 5250  ‘cfv 5254  (class class class)co 5918  1_oc1o 6462  2_oc2o 6463   ↑_𝑚 cmap 6702  ℕ_∞xnninf 7178

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1o 6469  df-2o 6470  df-map 6704  df-nninf 7179

This theorem is referenced by:  peano4nninf  15496