lmxrge0 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lmxrge0		Structured version Visualization version GIF version

Theorem lmxrge0 32963

Description: Express "sequence 𝐹 converges to plus infinity" (i.e. diverges), for a sequence of nonnegative extended real numbers. (Contributed by Thierry Arnoux, 2-Aug-2017.)

**Hypotheses**
Ref	Expression
lmxrge0.j	⊢ 𝐽 = (TopOpen‘(ℝ^*_𝑠 ↾_s (0[,]+∞)))
lmxrge0.6	⊢ (𝜑 → 𝐹:ℕ⟶(0[,]+∞))
lmxrge0.7	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) = 𝐴)

**Assertion**
Ref	Expression
lmxrge0	⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))

Distinct variable groups: 𝑥,𝑗,𝐴 𝑗,𝑘,𝐹,𝑥 𝑘,𝐽,𝑥 𝜑,𝑘,𝑥 Allowed substitution hints: 𝜑(𝑗) 𝐴(𝑘) 𝐽(𝑗)

Proof of Theorem lmxrge0 Dummy variables 𝑎 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmxrge0.j	. . . . . . 7 ⊢ 𝐽 = (TopOpen‘(ℝ^*_𝑠 ↾_s (0[,]+∞)))
2		eqid 2733	. . . . . . . 8 ⊢ (ℝ^_𝑠 ↾_s (0[,]+∞)) = (ℝ^_𝑠 ↾_s (0[,]+∞))
3		xrstopn 22712	. . . . . . . 8 ⊢ (ordTop‘ ≤ ) = (TopOpen‘ℝ^*_𝑠)
4	2, 3	resstopn 22690	. . . . . . 7 ⊢ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) = (TopOpen‘(ℝ^*_𝑠 ↾_s (0[,]+∞)))
5	1, 4	eqtr4i 2764	. . . . . 6 ⊢ 𝐽 = ((ordTop‘ ≤ ) ↾_t (0[,]+∞))
6		letopon 22709	. . . . . . 7 ⊢ (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*)
7		iccssxr 13407	. . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ^*
8		resttopon 22665	. . . . . . 7 ⊢ (((ordTop‘ ≤ ) ∈ (TopOn‘ℝ^) ∧ (0[,]+∞) ⊆ ℝ^) → ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) ∈ (TopOn‘(0[,]+∞)))
9	6, 7, 8	mp2an 691	. . . . . 6 ⊢ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) ∈ (TopOn‘(0[,]+∞))
10	5, 9	eqeltri 2830	. . . . 5 ⊢ 𝐽 ∈ (TopOn‘(0[,]+∞))
11	10	a1i 11	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(0[,]+∞)))
12		nnuz 12865	. . . 4 ⊢ ℕ = (ℤ_≥‘1)
13		1zzd 12593	. . . 4 ⊢ (𝜑 → 1 ∈ ℤ)
14		lmxrge0.6	. . . 4 ⊢ (𝜑 → 𝐹:ℕ⟶(0[,]+∞))
15		lmxrge0.7	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) = 𝐴)
16	11, 12, 13, 14, 15	lmbrf 22764	. . 3 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ (+∞ ∈ (0[,]+∞) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))))
17		0xr 11261	. . . . 5 ⊢ 0 ∈ ℝ^*
18		pnfxr 11268	. . . . 5 ⊢ +∞ ∈ ℝ^*
19		0lepnf 13112	. . . . 5 ⊢ 0 ≤ +∞
20		ubicc2 13442	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 0 ≤ +∞) → +∞ ∈ (0[,]+∞))
21	17, 18, 19, 20	mp3an 1462	. . . 4 ⊢ +∞ ∈ (0[,]+∞)
22	21	biantrur 532	. . 3 ⊢ (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) ↔ (+∞ ∈ (0[,]+∞) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
23	16, 22	bitr4di 289	. 2 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
24		rexr 11260	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
25	18	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → +∞ ∈ ℝ^*)
26		ltpnf 13100	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 < +∞)
27		ubioc1 13377	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 𝑥 < +∞) → +∞ ∈ (𝑥(,]+∞))
28	24, 25, 26, 27	syl3anc 1372	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → +∞ ∈ (𝑥(,]+∞))
29		0ltpnf 13102	. . . . . . . . . 10 ⊢ 0 < +∞
30		ubioc1 13377	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 0 < +∞) → +∞ ∈ (0(,]+∞))
31	17, 18, 29, 30	mp3an 1462	. . . . . . . . 9 ⊢ +∞ ∈ (0(,]+∞)
32	28, 31	jctir 522	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (+∞ ∈ (𝑥(,]+∞) ∧ +∞ ∈ (0(,]+∞)))
33		elin 3965	. . . . . . . 8 ⊢ (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) ↔ (+∞ ∈ (𝑥(,]+∞) ∧ +∞ ∈ (0(,]+∞)))
34	32, 33	sylibr 233	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
35	34	ad2antlr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
36		letop 22710	. . . . . . . . . . 11 ⊢ (ordTop‘ ≤ ) ∈ Top
37		ovex 7442	. . . . . . . . . . 11 ⊢ (0[,]+∞) ∈ V
38		iocpnfordt 22719	. . . . . . . . . . . 12 ⊢ (𝑥(,]+∞) ∈ (ordTop‘ ≤ )
39		iocpnfordt 22719	. . . . . . . . . . . 12 ⊢ (0(,]+∞) ∈ (ordTop‘ ≤ )
40		inopn 22401	. . . . . . . . . . . 12 ⊢ (((ordTop‘ ≤ ) ∈ Top ∧ (𝑥(,]+∞) ∈ (ordTop‘ ≤ ) ∧ (0(,]+∞) ∈ (ordTop‘ ≤ )) → ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ ))
41	36, 38, 39, 40	mp3an 1462	. . . . . . . . . . 11 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ )
42		elrestr 17374	. . . . . . . . . . 11 ⊢ (((ordTop‘ ≤ ) ∈ Top ∧ (0[,]+∞) ∈ V ∧ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ )) → (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞)) ∈ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)))
43	36, 37, 41, 42	mp3an 1462	. . . . . . . . . 10 ⊢ (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞)) ∈ ((ordTop‘ ≤ ) ↾_t (0[,]+∞))
44		inss2 4230	. . . . . . . . . . . . 13 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0(,]+∞)
45		iocssicc 13414	. . . . . . . . . . . . 13 ⊢ (0(,]+∞) ⊆ (0[,]+∞)
46	44, 45	sstri 3992	. . . . . . . . . . . 12 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0[,]+∞)
47		sseqin2 4216	. . . . . . . . . . . 12 ⊢ (((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0[,]+∞) ↔ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = ((𝑥(,]+∞) ∩ (0(,]+∞)))
48	46, 47	mpbi 229	. . . . . . . . . . 11 ⊢ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = ((𝑥(,]+∞) ∩ (0(,]+∞))
49		incom 4202	. . . . . . . . . . 11 ⊢ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞))
50	48, 49	eqtr3i 2763	. . . . . . . . . 10 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) = (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞))
51	43, 50, 5	3eltr4i 2847	. . . . . . . . 9 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ 𝐽
52	51	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ 𝐽)
53		eleq2 2823	. . . . . . . . . . 11 ⊢ (𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞)) → (+∞ ∈ 𝑎 ↔ +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞))))
54	53	adantl 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (+∞ ∈ 𝑎 ↔ +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞))))
55	54	biimprd 247	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → +∞ ∈ 𝑎))
56		simp-5r 785	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 ∈ ℝ)
57	56	rexrd 11264	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 ∈ ℝ^*)
58		simpr 486	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ 𝑎)
59		simp-4r 783	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞)))
60	58, 59	eleqtrd 2836	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
61		elin 3965	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) ↔ (𝐴 ∈ (𝑥(,]+∞) ∧ 𝐴 ∈ (0(,]+∞)))
62	61	simplbi 499	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → 𝐴 ∈ (𝑥(,]+∞))
63	60, 62	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ (𝑥(,]+∞))
64		elioc1 13366	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ^* ∧ +∞ ∈ ℝ^) → (𝐴 ∈ (𝑥(,]+∞) ↔ (𝐴 ∈ ℝ^ ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)))
65	18, 64	mpan2 690	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ℝ^* → (𝐴 ∈ (𝑥(,]+∞) ↔ (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)))
66	65	biimpa 478	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ (𝑥(,]+∞)) → (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞))
67	66	simp2d 1144	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ (𝑥(,]+∞)) → 𝑥 < 𝐴)
68	57, 63, 67	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 < 𝐴)
69	68	ex 414	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝐴 ∈ 𝑎 → 𝑥 < 𝐴))
70	69	ralimdva 3168	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
71	70	reximdva 3169	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
72		fveq2 6892	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑙 → (ℤ_≥‘𝑗) = (ℤ_≥‘𝑙))
73	72	raleqdv 3326	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑙 → (∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
74	73	cbvrexvw 3236	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 ↔ ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴)
75	71, 74	imbitrrdi 251	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
76	55, 75	imim12d 81	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → ((+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)))
77	52, 76	rspcimdv 3603	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)))
78	77	imp 408	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
79	35, 78	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)
80	79	ex 414	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
81	80	ralrimdva 3155	. . 3 ⊢ (𝜑 → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
82		simplll 774	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → 𝜑)
83		simpllr 775	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → 𝑎 ∈ 𝐽)
84		simpr 486	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → +∞ ∈ 𝑎)
85	1	pnfneige0 32962	. . . . . . 7 ⊢ ((𝑎 ∈ 𝐽 ∧ +∞ ∈ 𝑎) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎)
86	83, 84, 85	syl2anc 585	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎)
87		simplr 768	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)
88		r19.29r 3117	. . . . . . . 8 ⊢ ((∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑥 ∈ ℝ ((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
89		simp-4l 782	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝜑)
90		uznnssnn 12879	. . . . . . . . . . . . . . . . 17 ⊢ (𝑙 ∈ ℕ → (ℤ_≥‘𝑙) ⊆ ℕ)
91	90	ad2antlr 726	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (ℤ_≥‘𝑙) ⊆ ℕ)
92		simpr 486	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑘 ∈ (ℤ_≥‘𝑙))
93	91, 92	sseldd 3984	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑘 ∈ ℕ)
94	89, 93	jca 513	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝜑 ∧ 𝑘 ∈ ℕ))
95		simp-4r 783	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑥 ∈ ℝ)
96		simpllr 775	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝑥(,]+∞) ⊆ 𝑎)
97		simplr 768	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → (𝑥(,]+∞) ⊆ 𝑎)
98		simplr 768	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 ∈ ℝ)
99	98	rexrd 11264	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 ∈ ℝ^*)
100	14	ffvelcdmda 7087	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ (0[,]+∞))
101	15, 100	eqeltrrd 2835	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ (0[,]+∞))
102	7, 101	sselid 3981	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℝ^*)
103	102	ad2antrr 725	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ∈ ℝ^*)
104		simpr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 < 𝐴)
105		pnfge 13110	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
106	103, 105	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ≤ +∞)
107	65	biimpar 479	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ^* ∧ (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)) → 𝐴 ∈ (𝑥(,]+∞))
108	99, 103, 104, 106, 107	syl13anc 1373	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ∈ (𝑥(,]+∞))
109	108	adantlr 714	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → 𝐴 ∈ (𝑥(,]+∞))
110	97, 109	sseldd 3984	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → 𝐴 ∈ 𝑎)
111	110	ex 414	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (𝑥 < 𝐴 → 𝐴 ∈ 𝑎))
112	94, 95, 96, 111	syl21anc 837	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝑥 < 𝐴 → 𝐴 ∈ 𝑎))
113	112	ralimdva 3168	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴 → ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
114	113	reximdva 3169	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
115	74, 114	biimtrid 241	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
116	115	expimpd 455	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
117	116	rexlimdva 3156	. . . . . . . 8 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
118	88, 117	syl5 34	. . . . . . 7 ⊢ (𝜑 → ((∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
119	118	imp 408	. . . . . 6 ⊢ ((𝜑 ∧ (∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)
120	82, 86, 87, 119	syl12anc 836	. . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)
121	120	exp31 421	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐽) → (∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
122	121	ralrimdva 3155	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
123	81, 122	impbid 211	. 2 ⊢ (𝜑 → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
124	23, 123	bitrd 279	1 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∩ cin 3948 ⊆ wss 3949 class class class wbr 5149 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℝcr 11109 0cc0 11110 1c1 11111 +∞cpnf 11245 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 ℕcn 12212 ℤ_≥cuz 12822 (,]cioc 13325 [,]cicc 13327 ↾_s cress 17173 ↾_t crest 17366 TopOpenctopn 17367 ordTopcordt 17445 ℝ^*_𝑠cxrs 17446 Topctop 22395 TopOnctopon 22412 ⇝_𝑡clm 22730

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fi 9406 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-ioo 13328 df-ioc 13329 df-ico 13330 df-icc 13331 df-fz 13485 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-tset 17216 df-ple 17217 df-ds 17219 df-rest 17368 df-topn 17369 df-topgen 17389 df-ordt 17447 df-xrs 17448 df-ps 18519 df-tsr 18520 df-top 22396 df-topon 22413 df-bases 22449 df-lm 22733

This theorem is referenced by: lmdvglim 32965

W3C validator