Theorem rlimpm 15556

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 15545	. . . . 5 ⊢ ⇝𝑟 = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))}
2		opabssxp 5753	. . . . 5 ⊢ {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))} ⊆ ((ℂ ↑pm ℝ) × ℂ)
3	1, 2	eqsstri 3983	. . . 4 ⊢ ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ)
4		dmss 5892	. . . 4 ⊢ ( ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ) → dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ))
5	3, 4	ax-mp 5	. . 3 ⊢ dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ)
6		dmxpss 6169	. . 3 ⊢ dom ((ℂ ↑pm ℝ) × ℂ) ⊆ (ℂ ↑pm ℝ)
7	5, 6	sstri 3946	. 2 ⊢ dom ⇝𝑟 ⊆ (ℂ ↑pm ℝ)
8		rlimrel 15549	. . 3 ⊢ Rel ⇝𝑟
9	8	releldmi 5938	. 2 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ dom ⇝𝑟 )
10	7, 9	sselid 3935	1 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ (ℂ ↑pm ℝ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ⊆ wss 3905   class class class wbr 5109  {copab 5173   × cxp 5659  dom cdm 5661  ‘cfv 6536  (class class class)co 7410   ↑_pm cpm 8821  ℂcc 11102  ℝcr 11103   < clt 11247   ≤ cle 11248   − cmin 11445  ℝ⁺crp 13020  abscabs 15290   ⇝_𝑟 crli 15541

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-dm 5671  df-rlim 15545

This theorem is used by:  rlimf  15557  rlimss  15558  rlimclim1  15601