Theorem limsupre3lem 45728

Description: Given a function on the extended 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, at some point, in any upper part of the reals; 2. there is a real number that is eventually greater than or equal to the function. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupre3lem.1	⊢ Ⅎ𝑗𝐹
limsupre3lem.2	⊢ (𝜑 → 𝐴 ⊆ ℝ)
limsupre3lem.3	⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)

Assertion

Ref	Expression
limsupre3lem	⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))))

Distinct variable groups:   𝐴,𝑗,𝑘,𝑥   𝑘,𝐹,𝑥   𝜑,𝑗,𝑘,𝑥

Allowed substitution hint:   𝐹(𝑗)

Proof of Theorem limsupre3lem

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		limsupre3lem.1	. . 3 ⊢ Ⅎ𝑗𝐹
2		limsupre3lem.2	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
3		limsupre3lem.3	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)
4	1, 2, 3	limsupre2 45721	. 2 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ∧ ∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦))))
5		simp2 1137	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → 𝑦 ∈ ℝ)
6		nfv 1914	. . . . . . . . . 10 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑦 ∈ ℝ)
7		simp3l 1202	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → 𝑘 ≤ 𝑗)
8		simp1r 1199	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ 𝑦 < (𝐹‘𝑗)) → 𝑦 ∈ ℝ)
9	8	rexrd 11290	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ 𝑦 < (𝐹‘𝑗)) → 𝑦 ∈ ℝ*)
10	3	ffvelcdmda 7079	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → (𝐹‘𝑗) ∈ ℝ*)
11	10	adantlr 715	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → (𝐹‘𝑗) ∈ ℝ*)
12	11	3adant3 1132	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ 𝑦 < (𝐹‘𝑗)) → (𝐹‘𝑗) ∈ ℝ*)
13		simp3 1138	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ 𝑦 < (𝐹‘𝑗)) → 𝑦 < (𝐹‘𝑗))
14	9, 12, 13	xrltled 13171	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ 𝑦 < (𝐹‘𝑗)) → 𝑦 ≤ (𝐹‘𝑗))
15	14	3adant3l 1181	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → 𝑦 ≤ (𝐹‘𝑗))
16	7, 15	jca 511	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))
17	16	3exp 1119	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑗 ∈ 𝐴 → ((𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) → (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))))
18	6, 17	reximdai 3248	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) → ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
19	18	ralimdv 3155	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) → ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
20	19	3impia 1117	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))
21		breq1 5127	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝑥 ≤ (𝐹‘𝑗) ↔ 𝑦 ≤ (𝐹‘𝑗)))
22	21	anbi2d 630	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → ((𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
23	22	rexbidv 3165	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
24	23	ralbidv 3164	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
25	24	rspcev 3606	. . . . . . 7 ⊢ ((𝑦 ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)))
26	5, 20, 25	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)))
27	26	3exp 1119	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ ℝ → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)))))
28	27	rexlimdv 3140	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
29		peano2rem 11555	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → (𝑥 − 1) ∈ ℝ)
30	29	ad2antlr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝑥 − 1) ∈ ℝ)
31		nfv 1914	. . . . . . . . 9 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑥 ∈ ℝ)
32		simp3l 1202	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → 𝑘 ≤ 𝑗)
33		simp1r 1199	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → 𝑥 ∈ ℝ)
34	29	rexrd 11290	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → (𝑥 − 1) ∈ ℝ*)
35	33, 34	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝑥 − 1) ∈ ℝ*)
36	33	rexrd 11290	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → 𝑥 ∈ ℝ*)
37	10	adantlr 715	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → (𝐹‘𝑗) ∈ ℝ*)
38	37	3adant3 1132	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝐹‘𝑗) ∈ ℝ*)
39	33	ltm1d 12179	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝑥 − 1) < 𝑥)
40		simp3r 1203	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → 𝑥 ≤ (𝐹‘𝑗))
41	35, 36, 38, 39, 40	xrltletrd 13182	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝑥 − 1) < (𝐹‘𝑗))
42	32, 41	jca 511	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴 ∧ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗)))
43	42	3exp 1119	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑗 ∈ 𝐴 → ((𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) → (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗)))))
44	31, 43	reximdai 3248	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) → ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))))
45	44	ralimdv 3155	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) → ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))))
46	45	imp 406	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗)))
47		breq1 5127	. . . . . . . . . 10 ⊢ (𝑦 = (𝑥 − 1) → (𝑦 < (𝐹‘𝑗) ↔ (𝑥 − 1) < (𝐹‘𝑗)))
48	47	anbi2d 630	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 − 1) → ((𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ↔ (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))))
49	48	rexbidv 3165	. . . . . . . 8 ⊢ (𝑦 = (𝑥 − 1) → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))))
50	49	ralbidv 3164	. . . . . . 7 ⊢ (𝑦 = (𝑥 − 1) → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))))
51	50	rspcev 3606	. . . . . 6 ⊢ (((𝑥 − 1) ∈ ℝ ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ (𝑥 − 1) < (𝐹‘𝑗))) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)))
52	30, 46, 51	syl2anc 584	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)))
53	52	rexlimdva2 3144	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗))))
54	28, 53	impbid 212	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
55		simplr 768	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦)) → 𝑦 ∈ ℝ)
56	11	adantr 480	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) < 𝑦) → (𝐹‘𝑗) ∈ ℝ*)
57		rexr 11286	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ*)
58	57	ad3antlr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) < 𝑦) → 𝑦 ∈ ℝ*)
59		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) < 𝑦) → (𝐹‘𝑗) < 𝑦)
60	56, 58, 59	xrltled 13171	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) < 𝑦) → (𝐹‘𝑗) ≤ 𝑦)
61	60	ex 412	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → ((𝐹‘𝑗) < 𝑦 → (𝐹‘𝑗) ≤ 𝑦))
62	61	imim2d 57	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → ((𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
63	62	ralimdva 3153	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) → ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
64	63	reximdv 3156	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
65	64	imp 406	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦)) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦))
66		breq2 5128	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑦))
67	66	imbi2d 340	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ↔ (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
68	67	ralbidv 3164	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
69	68	rexbidv 3165	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)))
70	69	rspcev 3606	. . . . . 6 ⊢ ((𝑦 ∈ ℝ ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑦)) → ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
71	55, 65, 70	syl2anc 584	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦)) → ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
72	71	rexlimdva2 3144	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) → ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
73		peano2re 11413	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ)
74	73	ad2antlr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → (𝑥 + 1) ∈ ℝ)
75	37	adantr 480	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → (𝐹‘𝑗) ∈ ℝ*)
76		rexr 11286	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*)
77	76	ad3antlr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → 𝑥 ∈ ℝ*)
78	73	rexrd 11290	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ*)
79	78	ad3antlr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → (𝑥 + 1) ∈ ℝ*)
80		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → (𝐹‘𝑗) ≤ 𝑥)
81		ltp1 12086	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → 𝑥 < (𝑥 + 1))
82	81	ad3antlr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → 𝑥 < (𝑥 + 1))
83	75, 77, 79, 80, 82	xrlelttrd 13181	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ (𝐹‘𝑗) ≤ 𝑥) → (𝐹‘𝑗) < (𝑥 + 1))
84	83	ex 412	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → ((𝐹‘𝑗) ≤ 𝑥 → (𝐹‘𝑗) < (𝑥 + 1)))
85	84	imim2d 57	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) → ((𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
86	85	ralimdva 3153	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
87	86	reximdv 3156	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
88	87	imp 406	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1)))
89		breq2 5128	. . . . . . . . . 10 ⊢ (𝑦 = (𝑥 + 1) → ((𝐹‘𝑗) < 𝑦 ↔ (𝐹‘𝑗) < (𝑥 + 1)))
90	89	imbi2d 340	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 + 1) → ((𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) ↔ (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
91	90	ralbidv 3164	. . . . . . . 8 ⊢ (𝑦 = (𝑥 + 1) → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
92	91	rexbidv 3165	. . . . . . 7 ⊢ (𝑦 = (𝑥 + 1) → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))))
93	92	rspcev 3606	. . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < (𝑥 + 1))) → ∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦))
94	74, 88, 93	syl2anc 584	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → ∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦))
95	94	rexlimdva2 3144	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦)))
96	72, 95	impbid 212	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦) ↔ ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
97	54, 96	anbi12d 632	. 2 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 < (𝐹‘𝑗)) ∧ ∃𝑦 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) < 𝑦)) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))))
98	4, 97	bitrd 279	1 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ∧ ∃𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  Ⅎwnfc 2884  ∀wral 3052  ∃wrex 3061   ⊆ wss 3931   class class class wbr 5124  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  ℝcr 11133  1c1 11135   + caddc 11137  ℝ^*cxr 11273   < clt 11274   ≤ cle 11275   − cmin 11471  lim supclsp 15491

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734  ax-cnex 11190  ax-resscn 11191  ax-1cn 11192  ax-icn 11193  ax-addcl 11194  ax-addrcl 11195  ax-mulcl 11196  ax-mulrcl 11197  ax-mulcom 11198  ax-addass 11199  ax-mulass 11200  ax-distr 11201  ax-i2m1 11202  ax-1ne0 11203  ax-1rid 11204  ax-rnegex 11205  ax-rrecex 11206  ax-cnre 11207  ax-pre-lttri 11208  ax-pre-lttrn 11209  ax-pre-ltadd 11210  ax-pre-mulgt0 11211  ax-pre-sup 11212

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-po 5566  df-so 5567  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-er 8724  df-en 8965  df-dom 8966  df-sdom 8967  df-sup 9459  df-inf 9460  df-pnf 11276  df-mnf 11277  df-xr 11278  df-ltxr 11279  df-le 11280  df-sub 11473  df-neg 11474  df-ico 13373  df-limsup 15492

This theorem is referenced by:  limsupre3  45729