Theorem limsupequzmpt2 46292

Description: Two functions that are eventually equal to one another have the same superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupequzmpt2.j	⊢ Ⅎ𝑗𝜑
limsupequzmpt2.o	⊢ Ⅎ𝑗𝐴
limsupequzmpt2.p	⊢ Ⅎ𝑗𝐵
limsupequzmpt2.a	⊢ 𝐴 = (ℤ≥‘𝑀)
limsupequzmpt2.b	⊢ 𝐵 = (ℤ≥‘𝑁)
limsupequzmpt2.k	⊢ (𝜑 → 𝐾 ∈ 𝐴)
limsupequzmpt2.e	⊢ (𝜑 → 𝐾 ∈ 𝐵)
limsupequzmpt2.c	⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ 𝑉)

Assertion

Ref	Expression
limsupequzmpt2	⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)))

Distinct variable group:   𝑗,𝐾

Allowed substitution hints:   𝜑(𝑗)   𝐴(𝑗)   𝐵(𝑗)   𝐶(𝑗)   𝑀(𝑗)   𝑁(𝑗)   𝑉(𝑗)

Proof of Theorem limsupequzmpt2

Step	Hyp	Ref	Expression
1		limsupequzmpt2.j	. . . . . . . . 9 ⊢ Ⅎ𝑗𝜑
2		limsupequzmpt2.a	. . . . . . . . . . . . . . 15 ⊢ 𝐴 = (ℤ≥‘𝑀)
3		limsupequzmpt2.k	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ 𝐴)
4	2, 3	uzssd2 45991	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐴)
5	4	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐴)
6		simpr 488	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ (ℤ≥‘𝐾))
7	5, 6	sseldd 3937	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐴)
8		limsupequzmpt2.c	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ 𝑉)
9	8	elexd 3477	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ V)
10	7, 9	jca 519	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
11		rabid 3435	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
12	10, 11	sylibr 236	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
13	12	ex 416	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}))
14	1, 13	ralrimi 3260	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
15		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑗(ℤ≥‘𝐾)
16		nfrab1 3434	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
17	15, 16	dfss3f 3928	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
18	14, 17	sylibr 236	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
19	16, 15	resmptf 6028	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
20	18, 19	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
21	20	eqcomd 2768	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
22	21	fveq2d 6871	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
23	2, 3	eluzelz2d 45987	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ)
24		eqid 2762	. . . . 5 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾)
25		limsupequzmpt2.o	. . . . . . . 8 ⊢ Ⅎ𝑗𝐴
26	2	fvexi 6881	. . . . . . . 8 ⊢ 𝐴 ∈ V
27	25, 26	rabexf 45712	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ∈ V
28	16, 27	mptexf 45812	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
29	28	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
30		eqid 2762	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
31	16, 30	dmmptssf 45807	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
32	25	ssrab2f 45695	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ 𝐴
33		uzssz 12860	. . . . . . . . 9 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
34	2, 33	eqsstri 3982	. . . . . . . 8 ⊢ 𝐴 ⊆ ℤ
35	32, 34	sstri 3945	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ ℤ
36	31, 35	sstri 3945	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
38	23, 24, 29, 37	limsupresuz2 46283	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
39	22, 38	eqtr2d 2798	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
40		limsupequzmpt2.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (ℤ≥‘𝑁)
41		limsupequzmpt2.e	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ 𝐵)
42	40, 41	uzssd2 45991	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐵)
43	42	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐵)
44	43, 6	sseldd 3937	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐵)
45	44, 9	jca 519	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
46		rabid 3435	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
47	45, 46	sylibr 236	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
48	47	ex 416	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}))
49	1, 48	ralrimi 3260	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
50		nfrab1 3434	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
51	15, 50	dfss3f 3928	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
52	49, 51	sylibr 236	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
53	50, 15	resmptf 6028	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
54	52, 53	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
55	54	eqcomd 2768	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
56	55	fveq2d 6871	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
57		limsupequzmpt2.p	. . . . . . . 8 ⊢ Ⅎ𝑗𝐵
58	40	fvexi 6881	. . . . . . . 8 ⊢ 𝐵 ∈ V
59	57, 58	rabexf 45712	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ∈ V
60	50, 59	mptexf 45812	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
61	60	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
62		eqid 2762	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
63	50, 62	dmmptssf 45807	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
64	57	ssrab2f 45695	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ 𝐵
65		uzssz 12860	. . . . . . . . 9 ⊢ (ℤ≥‘𝑁) ⊆ ℤ
66	40, 65	eqsstri 3982	. . . . . . . 8 ⊢ 𝐵 ⊆ ℤ
67	64, 66	sstri 3945	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ ℤ
68	63, 67	sstri 3945	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
69	68	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
70	23, 24, 61, 69	limsupresuz2 46283	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
71	56, 70	eqtr2d 2798	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
72	39, 71	eqtr4d 2800	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
73		eqid 2762	. . . . 5 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
74	25, 73	mptssid 45816	. . . 4 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
75	74	fveq2i 6870	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶))
76	75	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
77		eqid 2762	. . . . 5 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
78	57, 77	mptssid 45816	. . . 4 ⊢ (𝑗 ∈ 𝐵 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
79	78	fveq2i 6870	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶))
80	79	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
81	72, 76, 80	3eqtr4d 2807	1 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1560  Ⅎwnf 1803   ∈ wcel 2142  Ⅎwnfc 2909  ∀wral 3076  {crab 3414  Vcvv 3454   ⊆ wss 3904   ↦ cmpt 5181  dom cdm 5647   ↾ cres 5649  ‘cfv 6521  ℤcz 12568  ℤ_≥cuz 12839  lim supclsp 15497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130  ax-1cn 11131  ax-icn 11132  ax-addcl 11133  ax-addrcl 11134  ax-mulcl 11135  ax-mulrcl 11136  ax-mulcom 11137  ax-addass 11138  ax-mulass 11139  ax-distr 11140  ax-i2m1 11141  ax-1ne0 11142  ax-1rid 11143  ax-rnegex 11144  ax-rrecex 11145  ax-cnre 11146  ax-pre-lttri 11147  ax-pre-lttrn 11148  ax-pre-ltadd 11149  ax-pre-mulgt0 11150  ax-pre-sup 11151

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-er 8678  df-en 8928  df-dom 8929  df-sdom 8930  df-sup 9388  df-inf 9389  df-pnf 11218  df-mnf 11219  df-xr 11220  df-ltxr 11221  df-le 11222  df-sub 11416  df-neg 11417  df-div 11845  df-nn 12211  df-n0 12482  df-z 12569  df-uz 12840  df-q 12950  df-ico 13355  df-limsup 15498

This theorem is referenced by:  smflimsupmpt  47403