Theorem lmbr 23484

Description: Express the binary relation "sequence 𝐹 converges to point 𝑃 " in a topological 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 23455. (Contributed by Mario Carneiro, 14-Nov-2013.)

Hypothesis

Ref	Expression
lmbr.2	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))

Assertion

Ref	Expression
lmbr	⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))))

Distinct variable groups:   𝑦,𝑢,𝐹   𝑢,𝐽,𝑦   𝜑,𝑢   𝑢,𝑃   𝑢,𝑋,𝑦

Allowed substitution hints:   𝜑(𝑦)   𝑃(𝑦)

Proof of Theorem lmbr

Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmbr.2	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2		lmfval 23458	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
3	1, 2	syl 18	. . 3 ⊢ (𝜑 → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
4	3	breqd 5118	. 2 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ 𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃))
5		reseq1 5970	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 ↾ 𝑦) = (𝐹 ↾ 𝑦))
6	5	feq1d 6688	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ (𝐹 ↾ 𝑦):𝑦⟶𝑢))
7	6	rexbidv 3188	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))
8	7	imbi2d 343	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
9	8	ralbidv 3187	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
10		eleq1 2850	. . . . . . 7 ⊢ (𝑥 = 𝑃 → (𝑥 ∈ 𝑢 ↔ 𝑃 ∈ 𝑢))
11	10	imbi1d 344	. . . . . 6 ⊢ (𝑥 = 𝑃 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
12	11	ralbidv 3187	. . . . 5 ⊢ (𝑥 = 𝑃 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
13	9, 12	sylan9bb 519	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑃) → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
14		df-3an 1105	. . . . 5 ⊢ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)))
15	14	opabbii 5176	. . . 4 ⊢ {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))} = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}
16	13, 15	brab2a 5752	. . 3 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
17		df-3an 1105	. . 3 ⊢ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
18	16, 17	bitr4i 281	. 2 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
19	4, 18	bitrdi 290	1 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   class class class wbr 5107  {copab 5171  ran crn 5660   ↾ cres 5661  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416   ↑_pm cpm 8830  ℂcc 11125  ℤ_≥cuz 12890  TopOnctopon 23136  ⇝_𝑡clm 23452

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-top 23120  df-topon 23137  df-lm 23455

This theorem is used by:  lmbr2  23485  lmfpm  23521  lmcl  23523  lmff  23527  lmmbr  25487