Theorem rlimpm 15699

Description: Closure of a function with a limit in the complex numbers. (Contributed by Mario Carneiro, 16-Sep-2014.)

Assertion

Ref	Expression
rlimpm	⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ (ℂ ↑pm ℝ))

Proof of Theorem rlimpm

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

Step	Hyp	Ref	Expression
1		df-rlim 15688	. . . . 5 ⊢ ⇝𝑟 = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))}
2		opabssxp 5749	. . . . 5 ⊢ {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))} ⊆ ((ℂ ↑pm ℝ) × ℂ)
3	1, 2	eqsstri 3959	. . . 4 ⊢ ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ)
4		dmss 5892	. . . 4 ⊢ ( ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ) → dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ))
5	3, 4	ax-mp 5	. . 3 ⊢ dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ)
6		dmxpss 6176	. . 3 ⊢ dom ((ℂ ↑pm ℝ) × ℂ) ⊆ (ℂ ↑pm ℝ)
7	5, 6	sstri 3922	. 2 ⊢ dom ⇝𝑟 ⊆ (ℂ ↑pm ℝ)
8		rlimrel 15692	. . 3 ⊢ Rel ⇝𝑟
9	8	releldmi 5938	. 2 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ dom ⇝𝑟 )
10	7, 9	sselid 3911	1 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ (ℂ ↑pm ℝ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5106  {copab 5171   × cxp 5654  dom cdm 5656  ‘cfv 6561  (class class class)co 7446   ↑_pm cpm 8879  ℂcc 11228  ℝcr 11229   < clt 11373   ≤ cle 11374   − cmin 11571  ℝ⁺crp 13150  abscabs 15433   ⇝_𝑟 crli 15684

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-xp 5662  df-rel 5663  df-dm 5666  df-rlim 15688

This theorem is used by:  rlimf  15700  rlimss  15701  rlimclim1  15744