Theorem limsupequzmpt2 41991

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 41683	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐴)
5	4	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐴)
6		simpr 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ (ℤ≥‘𝐾))
7	5, 6	sseldd 3968	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐴)
8		limsupequzmpt2.c	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ 𝑉)
9	8	elexd 3515	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ V)
10	7, 9	jca 514	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
11		rabid 3379	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
12	10, 11	sylibr 236	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
13	12	ex 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}))
14	1, 13	ralrimi 3216	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
15		nfcv 2977	. . . . . . . . 9 ⊢ Ⅎ𝑗(ℤ≥‘𝐾)
16		nfrab1 3385	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
17	15, 16	dfss3f 3959	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
18	14, 17	sylibr 236	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
19	16, 15	resmptf 5902	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
20	18, 19	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
21	20	eqcomd 2827	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
22	21	fveq2d 6669	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
23	2, 3	eluzelz2d 41679	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ)
24		eqid 2821	. . . . 5 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾)
25		limsupequzmpt2.o	. . . . . . . 8 ⊢ Ⅎ𝑗𝐴
26	2	fvexi 6679	. . . . . . . 8 ⊢ 𝐴 ∈ V
27	25, 26	rabexf 41393	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ∈ V
28	16, 27	mptexf 41499	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
29	28	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
30		eqid 2821	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
31	16, 30	dmmptssf 41494	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
32	25	ssrab2f 41376	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ 𝐴
33		uzssz 12258	. . . . . . . . 9 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
34	2, 33	eqsstri 4001	. . . . . . . 8 ⊢ 𝐴 ⊆ ℤ
35	32, 34	sstri 3976	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ ℤ
36	31, 35	sstri 3976	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
38	23, 24, 29, 37	limsupresuz2 41982	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
39	22, 38	eqtr2d 2857	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
40		limsupequzmpt2.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (ℤ≥‘𝑁)
41		limsupequzmpt2.e	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ 𝐵)
42	40, 41	uzssd2 41683	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐵)
43	42	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐵)
44	43, 6	sseldd 3968	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐵)
45	44, 9	jca 514	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
46		rabid 3379	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
47	45, 46	sylibr 236	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
48	47	ex 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}))
49	1, 48	ralrimi 3216	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
50		nfrab1 3385	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
51	15, 50	dfss3f 3959	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
52	49, 51	sylibr 236	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
53	50, 15	resmptf 5902	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
54	52, 53	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
55	54	eqcomd 2827	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
56	55	fveq2d 6669	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
57		limsupequzmpt2.p	. . . . . . . 8 ⊢ Ⅎ𝑗𝐵
58	40	fvexi 6679	. . . . . . . 8 ⊢ 𝐵 ∈ V
59	57, 58	rabexf 41393	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ∈ V
60	50, 59	mptexf 41499	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
61	60	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
62		eqid 2821	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
63	50, 62	dmmptssf 41494	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
64	57	ssrab2f 41376	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ 𝐵
65		uzssz 12258	. . . . . . . . 9 ⊢ (ℤ≥‘𝑁) ⊆ ℤ
66	40, 65	eqsstri 4001	. . . . . . . 8 ⊢ 𝐵 ⊆ ℤ
67	64, 66	sstri 3976	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ ℤ
68	63, 67	sstri 3976	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
69	68	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
70	23, 24, 61, 69	limsupresuz2 41982	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
71	56, 70	eqtr2d 2857	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
72	39, 71	eqtr4d 2859	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
73		eqid 2821	. . . . 5 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
74	25, 73	mptssid 41503	. . . 4 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
75	74	fveq2i 6668	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶))
76	75	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
77		eqid 2821	. . . . 5 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
78	57, 77	mptssid 41503	. . . 4 ⊢ (𝑗 ∈ 𝐵 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
79	78	fveq2i 6668	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶))
80	79	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
81	72, 76, 80	3eqtr4d 2866	1 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533  Ⅎwnf 1780   ∈ wcel 2110  Ⅎwnfc 2961  ∀wral 3138  {crab 3142  Vcvv 3495   ⊆ wss 3936   ↦ cmpt 5139  dom cdm 5550   ↾ cres 5552  ‘cfv 6350  ℤcz 11975  ℤ_≥cuz 12237  lim supclsp 14821

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608  ax-pre-sup 10609

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-er 8283  df-en 8504  df-dom 8505  df-sdom 8506  df-sup 8900  df-inf 8901  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-div 11292  df-nn 11633  df-n0 11892  df-z 11976  df-uz 12238  df-q 12343  df-ico 12738  df-limsup 14822

This theorem is referenced by:  smflimsupmpt  43096