Theorem lmbr 23320

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 23291. (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 23294	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
3	1, 2	syl 17	. . 3 ⊢ (𝜑 → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
4	3	breqd 5113	. 2 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ 𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃))
5		reseq1 5961	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 ↾ 𝑦) = (𝐹 ↾ 𝑦))
6	5	feq1d 6675	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ (𝐹 ↾ 𝑦):𝑦⟶𝑢))
7	6	rexbidv 3188	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))
8	7	imbi2d 342	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
9	8	ralbidv 3187	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
10		eleq1 2852	. . . . . . 7 ⊢ (𝑥 = 𝑃 → (𝑥 ∈ 𝑢 ↔ 𝑃 ∈ 𝑢))
11	10	imbi1d 343	. . . . . 6 ⊢ (𝑥 = 𝑃 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
12	11	ralbidv 3187	. . . . 5 ⊢ (𝑥 = 𝑃 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
13	9, 12	sylan9bb 517	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑃) → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
14		df-3an 1101	. . . . 5 ⊢ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)))
15	14	opabbii 5169	. . . 4 ⊢ {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))} = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}
16	13, 15	brab2a 5742	. . 3 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
17		df-3an 1101	. . 3 ⊢ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
18	16, 17	bitr4i 280	. 2 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
19	4, 18	bitrdi 289	1 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  ∀wral 3078  ∃wrex 3088   class class class wbr 5102  {copab 5164  ran crn 5650   ↾ cres 5651  ⟶wf 6519  ‘cfv 6523  (class class class)co 7398   ↑_pm cpm 8811  ℂcc 11073  ℤ_≥cuz 12841  TopOnctopon 22972  ⇝_𝑡clm 23288

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fv 6531  df-ov 7401  df-top 22956  df-topon 22973  df-lm 23291

This theorem is referenced by:  lmbr2  23321  lmfpm  23357  lmcl  23359  lmff  23363  lmmbr  25322