Theorem limsupreuz 45693

Description: Given a function on the reals, its supremum limit is real if and only if two condition holds: 1. there is a real number that is less than or equal to the function, infinitely often; 2. there is a real number that is greater than or equal to the function. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupreuz.1	⊢ Ⅎ𝑗𝐹
limsupreuz.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
limsupreuz.3	⊢ 𝑍 = (ℤ≥‘𝑀)
limsupreuz.4	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)

Assertion

Ref	Expression
limsupreuz	⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥)))

Distinct variable groups:   𝑘,𝐹,𝑥   𝑗,𝑍,𝑘,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑗,𝑘)   𝐹(𝑗)   𝑀(𝑥,𝑗,𝑘)

Proof of Theorem limsupreuz

Dummy variables 𝑖 𝑙 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2903	. . . 4 ⊢ Ⅎ𝑙𝐹
2		limsupreuz.2	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		limsupreuz.3	. . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀)
4		limsupreuz.4	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
5	4	frexr 45335	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*)
6	1, 2, 3, 5	limsupre3uzlem 45691	. . 3 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦)))
7		breq1 5151	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ (𝐹‘𝑙) ↔ 𝑥 ≤ (𝐹‘𝑙)))
8	7	rexbidv 3177	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ↔ ∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙)))
9	8	ralbidv 3176	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ↔ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙)))
10		fveq2 6907	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑘 → (ℤ≥‘𝑖) = (ℤ≥‘𝑘))
11	10	rexeqdv 3325	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙) ↔ ∃𝑙 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑙)))
12		nfcv 2903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝑥
13		nfcv 2903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 ≤
14		limsupreuz.1	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝐹
15		nfcv 2903	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝑙
16	14, 15	nffv 6917	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗(𝐹‘𝑙)
17	12, 13, 16	nfbr 5195	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 𝑥 ≤ (𝐹‘𝑙)
18		nfv 1912	. . . . . . . . . . . 12 ⊢ Ⅎ𝑙 𝑥 ≤ (𝐹‘𝑗)
19		fveq2 6907	. . . . . . . . . . . . 13 ⊢ (𝑙 = 𝑗 → (𝐹‘𝑙) = (𝐹‘𝑗))
20	19	breq2d 5160	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑗 → (𝑥 ≤ (𝐹‘𝑙) ↔ 𝑥 ≤ (𝐹‘𝑗)))
21	17, 18, 20	cbvrexw 3305	. . . . . . . . . . 11 ⊢ (∃𝑙 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑙) ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))
22	21	a1i 11	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑙) ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗)))
23	11, 22	bitrd 279	. . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙) ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗)))
24	23	cbvralvw 3235	. . . . . . . 8 ⊢ (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))
25	24	a1i 11	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑙) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗)))
26	9, 25	bitrd 279	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗)))
27	26	cbvrexvw 3236	. . . . 5 ⊢ (∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗))
28		breq2 5152	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑙) ≤ 𝑦 ↔ (𝐹‘𝑙) ≤ 𝑥))
29	28	ralbidv 3176	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥))
30	29	rexbidv 3177	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥))
31	10	raleqdv 3324	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥))
32	16, 13, 12	nfbr 5195	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝐹‘𝑙) ≤ 𝑥
33		nfv 1912	. . . . . . . . . . . 12 ⊢ Ⅎ𝑙(𝐹‘𝑗) ≤ 𝑥
34	19	breq1d 5158	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑗 → ((𝐹‘𝑙) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥))
35	32, 33, 34	cbvralw 3304	. . . . . . . . . . 11 ⊢ (∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
36	35	a1i 11	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
37	31, 36	bitrd 279	. . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
38	37	cbvrexvw 3236	. . . . . . . 8 ⊢ (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
39	38	a1i 11	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
40	30, 39	bitrd 279	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
41	40	cbvrexvw 3236	. . . . 5 ⊢ (∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
42	27, 41	anbi12i 628	. . . 4 ⊢ ((∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
43	42	a1i 11	. . 3 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)𝑦 ≤ (𝐹‘𝑙) ∧ ∃𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)))
44	6, 43	bitrd 279	. 2 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)))
45		nfv 1912	. . . . . . . 8 ⊢ Ⅎ𝑖(𝐹‘𝑗) ≤ 𝑥
46		nfcv 2903	. . . . . . . . . 10 ⊢ Ⅎ𝑗𝑖
47	14, 46	nffv 6917	. . . . . . . . 9 ⊢ Ⅎ𝑗(𝐹‘𝑖)
48	47, 13, 12	nfbr 5195	. . . . . . . 8 ⊢ Ⅎ𝑗(𝐹‘𝑖) ≤ 𝑥
49		fveq2 6907	. . . . . . . . 9 ⊢ (𝑗 = 𝑖 → (𝐹‘𝑗) = (𝐹‘𝑖))
50	49	breq1d 5158	. . . . . . . 8 ⊢ (𝑗 = 𝑖 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥))
51	45, 48, 50	cbvralw 3304	. . . . . . 7 ⊢ (∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑖 ∈ (ℤ≥‘𝑘)(𝐹‘𝑖) ≤ 𝑥)
52	51	rexbii 3092	. . . . . 6 ⊢ (∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑖 ∈ (ℤ≥‘𝑘)(𝐹‘𝑖) ≤ 𝑥)
53	52	rexbii 3092	. . . . 5 ⊢ (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑖 ∈ (ℤ≥‘𝑘)(𝐹‘𝑖) ≤ 𝑥)
54	53	a1i 11	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑖 ∈ (ℤ≥‘𝑘)(𝐹‘𝑖) ≤ 𝑥))
55		nfv 1912	. . . . 5 ⊢ Ⅎ𝑖𝜑
56	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → 𝐹:𝑍⟶ℝ)
57		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → 𝑖 ∈ 𝑍)
58	56, 57	ffvelcdmd 7105	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → (𝐹‘𝑖) ∈ ℝ)
59	55, 2, 3, 58	uzub 45381	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑖 ∈ (ℤ≥‘𝑘)(𝐹‘𝑖) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 (𝐹‘𝑖) ≤ 𝑥))
60		eqcom 2742	. . . . . . . . . 10 ⊢ (𝑗 = 𝑖 ↔ 𝑖 = 𝑗)
61	60	imbi1i 349	. . . . . . . . 9 ⊢ ((𝑗 = 𝑖 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥)) ↔ (𝑖 = 𝑗 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥)))
62		bicom 222	. . . . . . . . . 10 ⊢ (((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥) ↔ ((𝐹‘𝑖) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥))
63	62	imbi2i 336	. . . . . . . . 9 ⊢ ((𝑖 = 𝑗 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥)) ↔ (𝑖 = 𝑗 → ((𝐹‘𝑖) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥)))
64	61, 63	bitri 275	. . . . . . . 8 ⊢ ((𝑗 = 𝑖 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑖) ≤ 𝑥)) ↔ (𝑖 = 𝑗 → ((𝐹‘𝑖) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥)))
65	50, 64	mpbi 230	. . . . . . 7 ⊢ (𝑖 = 𝑗 → ((𝐹‘𝑖) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥))
66	48, 45, 65	cbvralw 3304	. . . . . 6 ⊢ (∀𝑖 ∈ 𝑍 (𝐹‘𝑖) ≤ 𝑥 ↔ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥)
67	66	rexbii 3092	. . . . 5 ⊢ (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 (𝐹‘𝑖) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥)
68	67	a1i 11	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 (𝐹‘𝑖) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥))
69	54, 59, 68	3bitrd 305	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥))
70	69	anbi2d 630	. 2 ⊢ (𝜑 → ((∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥)))
71	44, 70	bitrd 279	1 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐹‘𝑗) ≤ 𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  Ⅎwnfc 2888  ∀wral 3059  ∃wrex 3068   class class class wbr 5148  ⟶wf 6559  ‘cfv 6563  ℝcr 11152   ≤ cle 11294  ℤcz 12611  ℤ_≥cuz 12876  lim supclsp 15503

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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-sup 9480  df-inf 9481  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-n0 12525  df-z 12612  df-uz 12877  df-ico 13390  df-fz 13545  df-fzo 13692  df-fl 13829  df-ceil 13830  df-limsup 15504

This theorem is referenced by:  limsupreuzmpt  45695  limsupgtlem  45733