Theorem lmbr 14685

Description: Express the binary relation "sequence 𝐹 converges to point 𝑃 " in a topological space. Definition 1.4-1 of [Kreyszig] p. 25. The condition 𝐹 ⊆ (ℂ × 𝑋) allows us to use objects more general than sequences when convenient; see the comment in df-lm 14662. (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 14664	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
3	1, 2	syl 14	. . 3 ⊢ (𝜑 → (⇝𝑡‘𝐽) = {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))})
4	3	breqd 4055	. 2 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ 𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃))
5		reseq1 4953	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 ↾ 𝑦) = (𝐹 ↾ 𝑦))
6	5	feq1d 5412	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ (𝐹 ↾ 𝑦):𝑦⟶𝑢))
7	6	rexbidv 2507	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢 ↔ ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))
8	7	imbi2d 230	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
9	8	ralbidv 2506	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
10		eleq1 2268	. . . . . . 7 ⊢ (𝑥 = 𝑃 → (𝑥 ∈ 𝑢 ↔ 𝑃 ∈ 𝑢))
11	10	imbi1d 231	. . . . . 6 ⊢ (𝑥 = 𝑃 → ((𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
12	11	ralbidv 2506	. . . . 5 ⊢ (𝑥 = 𝑃 → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
13	9, 12	sylan9bb 462	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑃) → (∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢) ↔ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
14		df-3an 983	. . . . 5 ⊢ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢)))
15	14	opabbii 4111	. . . 4 ⊢ {⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))} = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}
16	13, 15	brab2a 4728	. . 3 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
17		df-3an 983	. . 3 ⊢ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)) ↔ ((𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋) ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
18	16, 17	bitr4i 187	. 2 ⊢ (𝐹{⟨𝑓, 𝑥⟩ ∣ (𝑓 ∈ (𝑋 ↑pm ℂ) ∧ 𝑥 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝑓 ↾ 𝑦):𝑦⟶𝑢))}𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢)))
19	4, 18	bitrdi 196	1 ⊢ (𝜑 → (𝐹(⇝𝑡‘𝐽)𝑃 ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ 𝑃 ∈ 𝑋 ∧ ∀𝑢 ∈ 𝐽 (𝑃 ∈ 𝑢 → ∃𝑦 ∈ ran ℤ≥(𝐹 ↾ 𝑦):𝑦⟶𝑢))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 981   = wceq 1373   ∈ wcel 2176  ∀wral 2484  ∃wrex 2485   class class class wbr 4044  {copab 4104  ran crn 4676   ↾ cres 4677  ⟶wf 5267  ‘cfv 5271  (class class class)co 5944   ↑_pm cpm 6736  ℂcc 7923  ℤ_≥cuz 9648  TopOnctopon 14482  ⇝_𝑡clm 14659

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-cnex 8016

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-pm 6738  df-top 14470  df-topon 14483  df-lm 14662

This theorem is referenced by:  lmbr2  14686  lmfpm  14715  lmcl  14717  lmff  14721