Theorem rlimpm 15672

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 15661	. . . . 5 ⊢ ⇝𝑟 = {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))}
2		opabssxp 5742	. . . . 5 ⊢ {⟨𝑓, 𝑥⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ ∀𝑤 ∈ dom 𝑓(𝑧 ≤ 𝑤 → (abs‘((𝑓‘𝑤) − 𝑥)) < 𝑦))} ⊆ ((ℂ ↑pm ℝ) × ℂ)
3	1, 2	eqsstri 3954	. . . 4 ⊢ ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ)
4		dmss 5883	. . . 4 ⊢ ( ⇝𝑟 ⊆ ((ℂ ↑pm ℝ) × ℂ) → dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ))
5	3, 4	ax-mp 5	. . 3 ⊢ dom ⇝𝑟 ⊆ dom ((ℂ ↑pm ℝ) × ℂ)
6		dmxpss 6162	. . 3 ⊢ dom ((ℂ ↑pm ℝ) × ℂ) ⊆ (ℂ ↑pm ℝ)
7	5, 6	sstri 3917	. 2 ⊢ dom ⇝𝑟 ⊆ (ℂ ↑pm ℝ)
8		rlimrel 15665	. . 3 ⊢ Rel ⇝𝑟
9	8	releldmi 5929	. 2 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ dom ⇝𝑟 )
10	7, 9	sselid 3906	1 ⊢ (𝐹 ⇝𝑟 𝐴 → 𝐹 ∈ (ℂ ↑pm ℝ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   class class class wbr 5102  {copab 5166   × cxp 5648  dom cdm 5650  ‘cfv 6538  (class class class)co 7420   ↑_pm cpm 8851  ℂcc 11201  ℝcr 11202   < clt 11346   ≤ cle 11347   − cmin 11544  ℝ⁺crp 13123  abscabs 15406   ⇝_𝑟 crli 15657

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-dm 5660  df-rlim 15661

This theorem is used by:  rlimf  15673  rlimss  15674  rlimclim1  15717