Theorem limsupequzmpt2 45689

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 45386	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐴)
5	4	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐴)
6		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ (ℤ≥‘𝐾))
7	5, 6	sseldd 3944	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐴)
8		limsupequzmpt2.c	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ 𝑉)
9	8	elexd 3468	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝐶 ∈ V)
10	7, 9	jca 511	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
11		rabid 3424	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐴 ∧ 𝐶 ∈ V))
12	10, 11	sylibr 234	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
13	12	ex 412	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}))
14	1, 13	ralrimi 3233	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
15		nfcv 2891	. . . . . . . . 9 ⊢ Ⅎ𝑗(ℤ≥‘𝐾)
16		nfrab1 3423	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
17	15, 16	dfss3f 3935	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
18	14, 17	sylibr 234	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V})
19	16, 15	resmptf 5999	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
20	18, 19	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
21	20	eqcomd 2735	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
22	21	fveq2d 6844	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
23	2, 3	eluzelz2d 45382	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ)
24		eqid 2729	. . . . 5 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾)
25		limsupequzmpt2.o	. . . . . . . 8 ⊢ Ⅎ𝑗𝐴
26	2	fvexi 6854	. . . . . . . 8 ⊢ 𝐴 ∈ V
27	25, 26	rabexf 45101	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ∈ V
28	16, 27	mptexf 45204	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
29	28	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
30		eqid 2729	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
31	16, 30	dmmptssf 45199	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
32	25	ssrab2f 45084	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ 𝐴
33		uzssz 12790	. . . . . . . . 9 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
34	2, 33	eqsstri 3990	. . . . . . . 8 ⊢ 𝐴 ⊆ ℤ
35	32, 34	sstri 3953	. . . . . . 7 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ⊆ ℤ
36	31, 35	sstri 3953	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
38	23, 24, 29, 37	limsupresuz2 45680	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
39	22, 38	eqtr2d 2765	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
40		limsupequzmpt2.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (ℤ≥‘𝑁)
41		limsupequzmpt2.e	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ 𝐵)
42	40, 41	uzssd2 45386	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ 𝐵)
43	42	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (ℤ≥‘𝐾) ⊆ 𝐵)
44	43, 6	sseldd 3944	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ 𝐵)
45	44, 9	jca 511	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
46		rabid 3424	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ (𝑗 ∈ 𝐵 ∧ 𝐶 ∈ V))
47	45, 46	sylibr 234	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
48	47	ex 412	. . . . . . . . 9 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) → 𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}))
49	1, 48	ralrimi 3233	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
50		nfrab1 3423	. . . . . . . . 9 ⊢ Ⅎ𝑗{𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
51	15, 50	dfss3f 3935	. . . . . . . 8 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↔ ∀𝑗 ∈ (ℤ≥‘𝐾)𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
52	49, 51	sylibr 234	. . . . . . 7 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V})
53	50, 15	resmptf 5999	. . . . . . 7 ⊢ ((ℤ≥‘𝐾) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
54	52, 53	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶))
55	54	eqcomd 2735	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶) = ((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾)))
56	55	fveq2d 6844	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)) = (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))))
57		limsupequzmpt2.p	. . . . . . . 8 ⊢ Ⅎ𝑗𝐵
58	40	fvexi 6854	. . . . . . . 8 ⊢ 𝐵 ∈ V
59	57, 58	rabexf 45101	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ∈ V
60	50, 59	mptexf 45204	. . . . . 6 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V
61	60	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ∈ V)
62		eqid 2729	. . . . . . . 8 ⊢ (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
63	50, 62	dmmptssf 45199	. . . . . . 7 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
64	57	ssrab2f 45084	. . . . . . . 8 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ 𝐵
65		uzssz 12790	. . . . . . . . 9 ⊢ (ℤ≥‘𝑁) ⊆ ℤ
66	40, 65	eqsstri 3990	. . . . . . . 8 ⊢ 𝐵 ⊆ ℤ
67	64, 66	sstri 3953	. . . . . . 7 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ⊆ ℤ
68	63, 67	sstri 3953	. . . . . 6 ⊢ dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ
69	68	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ⊆ ℤ)
70	23, 24, 61, 69	limsupresuz2 45680	. . . 4 ⊢ (𝜑 → (lim sup‘((𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶) ↾ (ℤ≥‘𝐾))) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
71	56, 70	eqtr2d 2765	. . 3 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ (ℤ≥‘𝐾) ↦ 𝐶)))
72	39, 71	eqtr4d 2767	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
73		eqid 2729	. . . . 5 ⊢ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V}
74	25, 73	mptssid 45208	. . . 4 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)
75	74	fveq2i 6843	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶))
76	75	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐴 ∣ 𝐶 ∈ V} ↦ 𝐶)))
77		eqid 2729	. . . . 5 ⊢ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} = {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V}
78	57, 77	mptssid 45208	. . . 4 ⊢ (𝑗 ∈ 𝐵 ↦ 𝐶) = (𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)
79	78	fveq2i 6843	. . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶))
80	79	a1i 11	. 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ {𝑗 ∈ 𝐵 ∣ 𝐶 ∈ V} ↦ 𝐶)))
81	72, 76, 80	3eqtr4d 2774	1 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  Ⅎwnf 1783   ∈ wcel 2109  Ⅎwnfc 2876  ∀wral 3044  {crab 3402  Vcvv 3444   ⊆ wss 3911   ↦ cmpt 5183  dom cdm 5631   ↾ cres 5633  ‘cfv 6499  ℤcz 12505  ℤ_≥cuz 12769  lim supclsp 15412

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121  ax-pre-sup 11122

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-sup 9369  df-inf 9370  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-div 11812  df-nn 12163  df-n0 12419  df-z 12506  df-uz 12770  df-q 12884  df-ico 13288  df-limsup 15413

This theorem is referenced by:  smflimsupmpt  46800