Theorem rlimpm 15591

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 15580	. . . . 5 ⊢ ⇝𝑟 = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))}
2		opabssxp 5751	. . . . 5 ⊢ {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))} ⊆ ((ℂ ↑pm ℝ) × ℂ)
3	1, 2	eqsstri 3980	. . . 4 ⊢ ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ)
4		dmss 5890	. . . 4 ⊢ ( ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ) → dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ))
5	3, 4	ax-mp 5	. . 3 ⊢ dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ)
6		dmxpss 6168	. . 3 ⊢ dom ((ℂ ↑pm ℝ) × ℂ) ⊆ (ℂ ↑pm ℝ)
7	5, 6	sstri 3943	. 2 ⊢ dom ⇝𝑟 ⊆ (ℂ ↑pm ℝ)
8		rlimrel 15584	. . 3 ⊢ Rel ⇝𝑟
9	8	releldmi 5936	. 2 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ dom ⇝𝑟 )
10	7, 9	sselid 3932	1 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ (ℂ ↑pm ℝ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902   class class class wbr 5107  {copab 5171   × cxp 5657  dom cdm 5659  ‘cfv 6537  (class class class)co 7417   ↑_pm cpm 8831  ℂcc 11126  ℝcr 11127   < clt 11271   ≤ cle 11272   − cmin 11469  ℝ⁺crp 13046  abscabs 15325   ⇝_𝑟 crli 15576

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-ext 2734  ax-sep 5255  ax-pr 5402

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-dm 5669  df-rlim 15580

This theorem is used by:  rlimf  15592  rlimss  15593  rlimclim1  15636