MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rlimres Structured version   Visualization version   GIF version

Theorem rlimres 15576
Description: The restriction of a function converges if the original converges. (Contributed by Mario Carneiro, 16-Sep-2014.)
Assertion
Ref Expression
rlimres (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴)

Proof of Theorem rlimres
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inss1 4186 . . . . . . . 8 (dom 𝐹𝐵) ⊆ dom 𝐹
2 ssralv 4003 . . . . . . . 8 ((dom 𝐹𝐵) ⊆ dom 𝐹 → (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
31, 2ax-mp 5 . . . . . . 7 (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
43reximi 3099 . . . . . 6 (∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
54ralimi 3098 . . . . 5 (∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
65anim2i 626 . . . 4 ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
76a1i 11 . . 3 (𝐹𝑟 𝐴 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
8 rlimf 15519 . . . 4 (𝐹𝑟 𝐴𝐹:dom 𝐹⟶ℂ)
9 rlimss 15520 . . . 4 (𝐹𝑟 𝐴 → dom 𝐹 ⊆ ℝ)
10 eqidd 2762 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ dom 𝐹) → (𝐹𝑧) = (𝐹𝑧))
118, 9, 10rlim 15513 . . 3 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
12 fssres 6725 . . . . . 6 ((𝐹:dom 𝐹⟶ℂ ∧ (dom 𝐹𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
138, 1, 12sylancl 595 . . . . 5 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
14 resres 5974 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹𝐵))
15 ffn 6686 . . . . . . . . 9 (𝐹:dom 𝐹⟶ℂ → 𝐹 Fn dom 𝐹)
16 fnresdm 6635 . . . . . . . . 9 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
178, 15, 163syl 18 . . . . . . . 8 (𝐹𝑟 𝐴 → (𝐹 ↾ dom 𝐹) = 𝐹)
1817reseq1d 5960 . . . . . . 7 (𝐹𝑟 𝐴 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹𝐵))
1914, 18eqtr3id 2810 . . . . . 6 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)) = (𝐹𝐵))
2019feq1d 6668 . . . . 5 (𝐹𝑟 𝐴 → ((𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ ↔ (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ))
2113, 20mpbid 234 . . . 4 (𝐹𝑟 𝐴 → (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ)
221, 9sstrid 3945 . . . 4 (𝐹𝑟 𝐴 → (dom 𝐹𝐵) ⊆ ℝ)
23 elinel2 4152 . . . . . 6 (𝑧 ∈ (dom 𝐹𝐵) → 𝑧𝐵)
2423fvresd 6882 . . . . 5 (𝑧 ∈ (dom 𝐹𝐵) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2524adantl 485 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ (dom 𝐹𝐵)) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2621, 22, 25rlim 15513 . . 3 (𝐹𝑟 𝐴 → ((𝐹𝐵) ⇝𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
277, 11, 263imtr4d 296 . 2 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴))
2827pm2.43i 52 1 (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  cin 3901  wss 3902   class class class wbr 5097  dom cdm 5643  cres 5645   Fn wfn 6511  wf 6512  cfv 6516  (class class class)co 7391  cc 11065  cr 11066   < clt 11210  cle 11211  cmin 11408  +crp 12987  abscabs 15252  𝑟 crli 15503
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-pow 5319  ax-pr 5387  ax-un 7713  ax-cnex 11123  ax-resscn 11124
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-fv 6524  df-ov 7394  df-oprab 7395  df-mpo 7396  df-pm 8805  df-rlim 15507
This theorem is referenced by:  rlimres2  15579  pnt  27666
  Copyright terms: Public domain W3C validator