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

Theorem rlimres 15511
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 4178 . . . . . . . 8 (dom 𝐹𝐵) ⊆ dom 𝐹
2 ssralv 3991 . . . . . . . 8 ((dom 𝐹𝐵) ⊆ dom 𝐹 → (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
31, 2ax-mp 5 . . . . . . 7 (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
43reximi 3076 . . . . . 6 (∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
54ralimi 3075 . . . . 5 (∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
65anim2i 618 . . . 4 ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
76a1i 11 . . 3 (𝐹𝑟 𝐴 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
8 rlimf 15454 . . . 4 (𝐹𝑟 𝐴𝐹:dom 𝐹⟶ℂ)
9 rlimss 15455 . . . 4 (𝐹𝑟 𝐴 → dom 𝐹 ⊆ ℝ)
10 eqidd 2738 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ dom 𝐹) → (𝐹𝑧) = (𝐹𝑧))
118, 9, 10rlim 15448 . . 3 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
12 fssres 6700 . . . . . 6 ((𝐹:dom 𝐹⟶ℂ ∧ (dom 𝐹𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
138, 1, 12sylancl 587 . . . . 5 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
14 resres 5951 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹𝐵))
15 ffn 6662 . . . . . . . . 9 (𝐹:dom 𝐹⟶ℂ → 𝐹 Fn dom 𝐹)
16 fnresdm 6611 . . . . . . . . 9 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
178, 15, 163syl 18 . . . . . . . 8 (𝐹𝑟 𝐴 → (𝐹 ↾ dom 𝐹) = 𝐹)
1817reseq1d 5937 . . . . . . 7 (𝐹𝑟 𝐴 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹𝐵))
1914, 18eqtr3id 2786 . . . . . 6 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)) = (𝐹𝐵))
2019feq1d 6644 . . . . 5 (𝐹𝑟 𝐴 → ((𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ ↔ (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ))
2113, 20mpbid 232 . . . 4 (𝐹𝑟 𝐴 → (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ)
221, 9sstrid 3934 . . . 4 (𝐹𝑟 𝐴 → (dom 𝐹𝐵) ⊆ ℝ)
23 elinel2 4143 . . . . . 6 (𝑧 ∈ (dom 𝐹𝐵) → 𝑧𝐵)
2423fvresd 6854 . . . . 5 (𝑧 ∈ (dom 𝐹𝐵) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2524adantl 481 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ (dom 𝐹𝐵)) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2621, 22, 25rlim 15448 . . 3 (𝐹𝑟 𝐴 → ((𝐹𝐵) ⇝𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
277, 11, 263imtr4d 294 . 2 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴))
2827pm2.43i 52 1 (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  cin 3889  wss 3890   class class class wbr 5086  dom cdm 5624  cres 5626   Fn wfn 6487  wf 6488  cfv 6492  (class class class)co 7360  cc 11027  cr 11028   < clt 11170  cle 11171  cmin 11368  +crp 12933  abscabs 15187  𝑟 crli 15438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-pm 8769  df-rlim 15442
This theorem is referenced by:  rlimres2  15514  pnt  27591
  Copyright terms: Public domain W3C validator