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 33623

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 2725	. . . . . . . 8 ⊢ (ℝ^_𝑠 ↾_s (0[,]+∞)) = (ℝ^_𝑠 ↾_s (0[,]+∞))
3		xrstopn 23142	. . . . . . . 8 ⊢ (ordTop‘ ≤ ) = (TopOpen‘ℝ^*_𝑠)
4	2, 3	resstopn 23120	. . . . . . 7 ⊢ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) = (TopOpen‘(ℝ^*_𝑠 ↾_s (0[,]+∞)))
5	1, 4	eqtr4i 2756	. . . . . 6 ⊢ 𝐽 = ((ordTop‘ ≤ ) ↾_t (0[,]+∞))
6		letopon 23139	. . . . . . 7 ⊢ (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*)
7		iccssxr 13439	. . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ^*
8		resttopon 23095	. . . . . . 7 ⊢ (((ordTop‘ ≤ ) ∈ (TopOn‘ℝ^) ∧ (0[,]+∞) ⊆ ℝ^) → ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) ∈ (TopOn‘(0[,]+∞)))
9	6, 7, 8	mp2an 690	. . . . . 6 ⊢ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)) ∈ (TopOn‘(0[,]+∞))
10	5, 9	eqeltri 2821	. . . . 5 ⊢ 𝐽 ∈ (TopOn‘(0[,]+∞))
11	10	a1i 11	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(0[,]+∞)))
12		nnuz 12895	. . . 4 ⊢ ℕ = (ℤ_≥‘1)
13		1zzd 12623	. . . 4 ⊢ (𝜑 → 1 ∈ ℤ)
14		lmxrge0.6	. . . 4 ⊢ (𝜑 → 𝐹:ℕ⟶(0[,]+∞))
15		lmxrge0.7	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) = 𝐴)
16	11, 12, 13, 14, 15	lmbrf 23194	. . 3 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ (+∞ ∈ (0[,]+∞) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))))
17		0xr 11291	. . . . 5 ⊢ 0 ∈ ℝ^*
18		pnfxr 11298	. . . . 5 ⊢ +∞ ∈ ℝ^*
19		0lepnf 13144	. . . . 5 ⊢ 0 ≤ +∞
20		ubicc2 13474	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 0 ≤ +∞) → +∞ ∈ (0[,]+∞))
21	17, 18, 19, 20	mp3an 1457	. . . 4 ⊢ +∞ ∈ (0[,]+∞)
22	21	biantrur 529	. . 3 ⊢ (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) ↔ (+∞ ∈ (0[,]+∞) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
23	16, 22	bitr4di 288	. 2 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
24		rexr 11290	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
25	18	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → +∞ ∈ ℝ^*)
26		ltpnf 13132	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 < +∞)
27		ubioc1 13409	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 𝑥 < +∞) → +∞ ∈ (𝑥(,]+∞))
28	24, 25, 26, 27	syl3anc 1368	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → +∞ ∈ (𝑥(,]+∞))
29		0ltpnf 13134	. . . . . . . . . 10 ⊢ 0 < +∞
30		ubioc1 13409	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 0 < +∞) → +∞ ∈ (0(,]+∞))
31	17, 18, 29, 30	mp3an 1457	. . . . . . . . 9 ⊢ +∞ ∈ (0(,]+∞)
32	28, 31	jctir 519	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (+∞ ∈ (𝑥(,]+∞) ∧ +∞ ∈ (0(,]+∞)))
33		elin 3961	. . . . . . . 8 ⊢ (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) ↔ (+∞ ∈ (𝑥(,]+∞) ∧ +∞ ∈ (0(,]+∞)))
34	32, 33	sylibr 233	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
35	34	ad2antlr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
36		letop 23140	. . . . . . . . . . 11 ⊢ (ordTop‘ ≤ ) ∈ Top
37		ovex 7450	. . . . . . . . . . 11 ⊢ (0[,]+∞) ∈ V
38		iocpnfordt 23149	. . . . . . . . . . . 12 ⊢ (𝑥(,]+∞) ∈ (ordTop‘ ≤ )
39		iocpnfordt 23149	. . . . . . . . . . . 12 ⊢ (0(,]+∞) ∈ (ordTop‘ ≤ )
40		inopn 22831	. . . . . . . . . . . 12 ⊢ (((ordTop‘ ≤ ) ∈ Top ∧ (𝑥(,]+∞) ∈ (ordTop‘ ≤ ) ∧ (0(,]+∞) ∈ (ordTop‘ ≤ )) → ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ ))
41	36, 38, 39, 40	mp3an 1457	. . . . . . . . . . 11 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ )
42		elrestr 17409	. . . . . . . . . . 11 ⊢ (((ordTop‘ ≤ ) ∈ Top ∧ (0[,]+∞) ∈ V ∧ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ (ordTop‘ ≤ )) → (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞)) ∈ ((ordTop‘ ≤ ) ↾_t (0[,]+∞)))
43	36, 37, 41, 42	mp3an 1457	. . . . . . . . . 10 ⊢ (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞)) ∈ ((ordTop‘ ≤ ) ↾_t (0[,]+∞))
44		inss2 4229	. . . . . . . . . . . . 13 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0(,]+∞)
45		iocssicc 13446	. . . . . . . . . . . . 13 ⊢ (0(,]+∞) ⊆ (0[,]+∞)
46	44, 45	sstri 3987	. . . . . . . . . . . 12 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0[,]+∞)
47		sseqin2 4214	. . . . . . . . . . . 12 ⊢ (((𝑥(,]+∞) ∩ (0(,]+∞)) ⊆ (0[,]+∞) ↔ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = ((𝑥(,]+∞) ∩ (0(,]+∞)))
48	46, 47	mpbi 229	. . . . . . . . . . 11 ⊢ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = ((𝑥(,]+∞) ∩ (0(,]+∞))
49		incom 4200	. . . . . . . . . . 11 ⊢ ((0[,]+∞) ∩ ((𝑥(,]+∞) ∩ (0(,]+∞))) = (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞))
50	48, 49	eqtr3i 2755	. . . . . . . . . 10 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) = (((𝑥(,]+∞) ∩ (0(,]+∞)) ∩ (0[,]+∞))
51	43, 50, 5	3eltr4i 2838	. . . . . . . . 9 ⊢ ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ 𝐽
52	51	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ((𝑥(,]+∞) ∩ (0(,]+∞)) ∈ 𝐽)
53		eleq2 2814	. . . . . . . . . . 11 ⊢ (𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞)) → (+∞ ∈ 𝑎 ↔ +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞))))
54	53	adantl 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (+∞ ∈ 𝑎 ↔ +∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞))))
55	54	biimprd 247	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → +∞ ∈ 𝑎))
56		simp-5r 784	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 ∈ ℝ)
57	56	rexrd 11294	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 ∈ ℝ^*)
58		simpr 483	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ 𝑎)
59		simp-4r 782	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞)))
60	58, 59	eleqtrd 2827	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)))
61		elin 3961	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) ↔ (𝐴 ∈ (𝑥(,]+∞) ∧ 𝐴 ∈ (0(,]+∞)))
62	61	simplbi 496	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → 𝐴 ∈ (𝑥(,]+∞))
63	60, 62	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝐴 ∈ (𝑥(,]+∞))
64		elioc1 13398	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ^* ∧ +∞ ∈ ℝ^) → (𝐴 ∈ (𝑥(,]+∞) ↔ (𝐴 ∈ ℝ^ ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)))
65	18, 64	mpan2 689	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ℝ^* → (𝐴 ∈ (𝑥(,]+∞) ↔ (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)))
66	65	biimpa 475	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ (𝑥(,]+∞)) → (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞))
67	66	simp2d 1140	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ (𝑥(,]+∞)) → 𝑥 < 𝐴)
68	57, 63, 67	syl2anc 582	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) ∧ 𝐴 ∈ 𝑎) → 𝑥 < 𝐴)
69	68	ex 411	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝐴 ∈ 𝑎 → 𝑥 < 𝐴))
70	69	ralimdva 3157	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) ∧ 𝑙 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
71	70	reximdva 3158	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
72		fveq2 6894	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑙 → (ℤ_≥‘𝑗) = (ℤ_≥‘𝑙))
73	72	raleqdv 3315	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑙 → (∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 ↔ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴))
74	73	cbvrexvw 3226	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 ↔ ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴)
75	71, 74	imbitrrdi 251	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎 → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
76	55, 75	imim12d 81	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑎 = ((𝑥(,]+∞) ∩ (0(,]+∞))) → ((+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)))
77	52, 76	rspcimdv 3597	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)))
78	77	imp 405	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → (+∞ ∈ ((𝑥(,]+∞) ∩ (0(,]+∞)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
79	35, 78	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)
80	79	ex 411	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
81	80	ralrimdva 3144	. . 3 ⊢ (𝜑 → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
82		simplll 773	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → 𝜑)
83		simpllr 774	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → 𝑎 ∈ 𝐽)
84		simpr 483	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → +∞ ∈ 𝑎)
85	1	pnfneige0 33622	. . . . . . 7 ⊢ ((𝑎 ∈ 𝐽 ∧ +∞ ∈ 𝑎) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎)
86	83, 84, 85	syl2anc 582	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎)
87		simplr 767	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)
88		r19.29r 3106	. . . . . . . 8 ⊢ ((∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑥 ∈ ℝ ((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
89		simp-4l 781	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝜑)
90		uznnssnn 12909	. . . . . . . . . . . . . . . . 17 ⊢ (𝑙 ∈ ℕ → (ℤ_≥‘𝑙) ⊆ ℕ)
91	90	ad2antlr 725	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (ℤ_≥‘𝑙) ⊆ ℕ)
92		simpr 483	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑘 ∈ (ℤ_≥‘𝑙))
93	91, 92	sseldd 3978	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑘 ∈ ℕ)
94	89, 93	jca 510	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝜑 ∧ 𝑘 ∈ ℕ))
95		simp-4r 782	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → 𝑥 ∈ ℝ)
96		simpllr 774	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝑥(,]+∞) ⊆ 𝑎)
97		simplr 767	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → (𝑥(,]+∞) ⊆ 𝑎)
98		simplr 767	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 ∈ ℝ)
99	98	rexrd 11294	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 ∈ ℝ^*)
100	14	ffvelcdmda 7091	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ (0[,]+∞))
101	15, 100	eqeltrrd 2826	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ (0[,]+∞))
102	7, 101	sselid 3975	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℝ^*)
103	102	ad2antrr 724	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ∈ ℝ^*)
104		simpr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝑥 < 𝐴)
105		pnfge 13142	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
106	103, 105	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ≤ +∞)
107	65	biimpar 476	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ^* ∧ (𝐴 ∈ ℝ^* ∧ 𝑥 < 𝐴 ∧ 𝐴 ≤ +∞)) → 𝐴 ∈ (𝑥(,]+∞))
108	99, 103, 104, 106, 107	syl13anc 1369	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ 𝑥 < 𝐴) → 𝐴 ∈ (𝑥(,]+∞))
109	108	adantlr 713	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → 𝐴 ∈ (𝑥(,]+∞))
110	97, 109	sseldd 3978	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑥 < 𝐴) → 𝐴 ∈ 𝑎)
111	110	ex 411	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (𝑥 < 𝐴 → 𝐴 ∈ 𝑎))
112	94, 95, 96, 111	syl21anc 836	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) ∧ 𝑘 ∈ (ℤ_≥‘𝑙)) → (𝑥 < 𝐴 → 𝐴 ∈ 𝑎))
113	112	ralimdva 3157	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) ∧ 𝑙 ∈ ℕ) → (∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴 → ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
114	113	reximdva 3158	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝑥 < 𝐴 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
115	74, 114	biimtrid 241	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (𝑥(,]+∞) ⊆ 𝑎) → (∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
116	115	expimpd 452	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
117	116	rexlimdva 3145	. . . . . . . 8 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ((𝑥(,]+∞) ⊆ 𝑎 ∧ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
118	88, 117	syl5 34	. . . . . . 7 ⊢ (𝜑 → ((∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎))
119	118	imp 405	. . . . . 6 ⊢ ((𝜑 ∧ (∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝑎 ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴)) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)
120	82, 86, 87, 119	syl12anc 835	. . . . 5 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐽) ∧ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴) ∧ +∞ ∈ 𝑎) → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)
121	120	exp31 418	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐽) → (∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
122	121	ralrimdva 3144	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴 → ∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎)))
123	81, 122	impbid 211	. 2 ⊢ (𝜑 → (∀𝑎 ∈ 𝐽 (+∞ ∈ 𝑎 → ∃𝑙 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑙)𝐴 ∈ 𝑎) ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))
124	23, 123	bitrd 278	1 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)+∞ ↔ ∀𝑥 ∈ ℝ ∃𝑗 ∈ ℕ ∀𝑘 ∈ (ℤ_≥‘𝑗)𝑥 < 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ∃wrex 3060 Vcvv 3463 ∩ cin 3944 ⊆ wss 3945 class class class wbr 5148 ⟶wf 6543 ‘cfv 6547 (class class class)co 7417 ℝcr 11137 0cc0 11138 1c1 11139 +∞cpnf 11275 ℝ^*cxr 11277 < clt 11278 ≤ cle 11279 ℕcn 12242 ℤ_≥cuz 12852 (,]cioc 13357 [,]cicc 13359 ↾_s cress 17208 ↾_t crest 17401 TopOpenctopn 17402 ordTopcordt 17480 ℝ^*_𝑠cxrs 17481 Topctop 22825 TopOnctopon 22842 ⇝_𝑡clm 23160

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 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 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-pm 8846 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-fi 9434 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-ioo 13360 df-ioc 13361 df-ico 13362 df-icc 13363 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-mulr 17246 df-tset 17251 df-ple 17252 df-ds 17254 df-rest 17403 df-topn 17404 df-topgen 17424 df-ordt 17482 df-xrs 17483 df-ps 18557 df-tsr 18558 df-top 22826 df-topon 22843 df-bases 22879 df-lm 23163

This theorem is referenced by: lmdvglim 33625

W3C validator