lmmbr2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > lmmbr2		Structured version Visualization version GIF version

Theorem lmmbr2 24775

Description: Express the binary relation "sequence 𝐹 converges to point 𝑃 " in a metric space. Definition 1.4-1 of [Kreyszig] p. 25. The condition 𝐹 ⊆ (ℂ × 𝑋) allows to use objects more general than sequences when convenient; see the comment in df-lm 22732. (Contributed by NM, 7-Dec-2006.) (Revised by Mario Carneiro, 1-May-2014.)

**Hypotheses**
Ref	Expression
lmmbr.2	⊢ 𝐽 = (MetOpen‘𝐷)
lmmbr.3	⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))

**Assertion**
Ref	Expression
lmmbr2	⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))

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

Proof of Theorem lmmbr2 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmmbr.2	. . 3 ⊢ 𝐽 = (MetOpen‘𝐷)
2		lmmbr.3	. . 3 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
3	1, 2	lmmbr 24774	. 2 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥))))
4		df-3an 1089	. . . 4 ⊢ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)) ↔ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)))
5		uzf 12824	. . . . . . . . . 10 ⊢ ℤ_≥:ℤ⟶𝒫 ℤ
6		ffn 6717	. . . . . . . . . 10 ⊢ (ℤ_≥:ℤ⟶𝒫 ℤ → ℤ_≥ Fn ℤ)
7		reseq2 5976	. . . . . . . . . . . 12 ⊢ (𝑦 = (ℤ_≥‘𝑗) → (𝐹 ↾ 𝑦) = (𝐹 ↾ (ℤ_≥‘𝑗)))
8		id 22	. . . . . . . . . . . 12 ⊢ (𝑦 = (ℤ_≥‘𝑗) → 𝑦 = (ℤ_≥‘𝑗))
9	7, 8	feq12d 6705	. . . . . . . . . . 11 ⊢ (𝑦 = (ℤ_≥‘𝑗) → ((𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥)))
10	9	rexrn 7088	. . . . . . . . . 10 ⊢ (ℤ_≥ Fn ℤ → (∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ ∃𝑗 ∈ ℤ (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥)))
11	5, 6, 10	mp2b 10	. . . . . . . . 9 ⊢ (∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ ∃𝑗 ∈ ℤ (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥))
12		simp2l 1199	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → 𝐹 ∈ (𝑋 ↑_pm ℂ))
13		elfvdm 6928	. . . . . . . . . . . . . . . 16 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
14	13	3ad2ant1 1133	. . . . . . . . . . . . . . 15 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → 𝑋 ∈ dom ∞Met)
15		cnex 11190	. . . . . . . . . . . . . . 15 ⊢ ℂ ∈ V
16		elpmg 8836	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ dom ∞Met ∧ ℂ ∈ V) → (𝐹 ∈ (𝑋 ↑_pm ℂ) ↔ (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋))))
17	14, 15, 16	sylancl 586	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → (𝐹 ∈ (𝑋 ↑_pm ℂ) ↔ (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋))))
18	12, 17	mpbid 231	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋)))
19	18	simpld 495	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → Fun 𝐹)
20		ffvresb 7123	. . . . . . . . . . . 12 ⊢ (Fun 𝐹 → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥))))
21	19, 20	syl 17	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥))))
22		rpxr 12982	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ^*)
23		elbl 23893	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ ℝ^*) → ((𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ (𝑃𝐷(𝐹‘𝑘)) < 𝑥)))
24	22, 23	syl3an3 1165	. . . . . . . . . . . . . . . 16 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ ℝ⁺) → ((𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ (𝑃𝐷(𝐹‘𝑘)) < 𝑥)))
25		xmetsym 23852	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ (𝐹‘𝑘) ∈ 𝑋) → (𝑃𝐷(𝐹‘𝑘)) = ((𝐹‘𝑘)𝐷𝑃))
26	25	breq1d 5158	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ (𝐹‘𝑘) ∈ 𝑋) → ((𝑃𝐷(𝐹‘𝑘)) < 𝑥 ↔ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))
27	26	3expa 1118	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝐹‘𝑘) ∈ 𝑋) → ((𝑃𝐷(𝐹‘𝑘)) < 𝑥 ↔ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))
28	27	pm5.32da 579	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (((𝐹‘𝑘) ∈ 𝑋 ∧ (𝑃𝐷(𝐹‘𝑘)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
29	28	3adant3 1132	. . . . . . . . . . . . . . . 16 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ ℝ⁺) → (((𝐹‘𝑘) ∈ 𝑋 ∧ (𝑃𝐷(𝐹‘𝑘)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
30	24, 29	bitrd 278	. . . . . . . . . . . . . . 15 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ ℝ⁺) → ((𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
31	30	3adant2l 1178	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → ((𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥) ↔ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
32	31	anbi2d 629	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥)) ↔ (𝑘 ∈ dom 𝐹 ∧ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))
33		3anass 1095	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥) ↔ (𝑘 ∈ dom 𝐹 ∧ ((𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
34	32, 33	bitr4di 288	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥)) ↔ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
35	34	ralbidv 3177	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ (𝑃(ball‘𝐷)𝑥)) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
36	21, 35	bitrd 278	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
37	36	rexbidv 3178	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ ℤ (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶(𝑃(ball‘𝐷)𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
38	11, 37	bitrid 282	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ℝ⁺) → (∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
39	38	3expa 1118	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋)) ∧ 𝑥 ∈ ℝ⁺) → (∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
40	39	ralbidva 3175	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋)) → (∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
41	40	pm5.32da 579	. . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)) ↔ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))
42	2, 41	syl 17	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)) ↔ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))
43	4, 42	bitrid 282	. . 3 ⊢ (𝜑 → ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)) ↔ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))
44		df-3an 1089	. . 3 ⊢ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)) ↔ ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥)))
45	43, 44	bitr4di 288	. 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ran ℤ_≥(𝐹 ↾ 𝑦):𝑦⟶(𝑃(ball‘𝐷)𝑥)) ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))
46	3, 45	bitrd 278	1 ⊢ (𝜑 → (𝐹(⇝_𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑_pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ ((𝐹‘𝑘)𝐷𝑃) < 𝑥))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3948 𝒫 cpw 4602 class class class wbr 5148 × cxp 5674 dom cdm 5676 ran crn 5677 ↾ cres 5678 Fun wfun 6537 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7408 ↑_pm cpm 8820 ℂcc 11107 ℝ^*cxr 11246 < clt 11247 ℤcz 12557 ℤ_≥cuz 12821 ℝ⁺crp 12973 ∞Metcxmet 20928 ballcbl 20930 MetOpencmopn 20933 ⇝_𝑡clm 22729

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-map 8821 df-pm 8822 df-en 8939 df-dom 8940 df-sdom 8941 df-sup 9436 df-inf 9437 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-nn 12212 df-2 12274 df-n0 12472 df-z 12558 df-uz 12822 df-q 12932 df-rp 12974 df-xneg 13091 df-xadd 13092 df-xmul 13093 df-topgen 17388 df-psmet 20935 df-xmet 20936 df-bl 20938 df-mopn 20939 df-top 22395 df-topon 22412 df-bases 22448 df-lm 22732

This theorem is referenced by: lmmbr3 24776

W3C validator