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

Theorem rlimres 15605
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 4189 . . . . . . . 8 (dom 𝐹𝐵) ⊆ dom 𝐹
2 ssralv 4006 . . . . . . . 8 ((dom 𝐹𝐵) ⊆ dom 𝐹 → (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
31, 2ax-mp 5 . . . . . . 7 (∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
43reximi 3103 . . . . . 6 (∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
54ralimi 3102 . . . . 5 (∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥) → ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))
65anim2i 628 . . . 4 ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)))
76a1i 11 . . 3 (𝐹𝑟 𝐴 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥)) → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
8 rlimf 15548 . . . 4 (𝐹𝑟 𝐴𝐹:dom 𝐹⟶ℂ)
9 rlimss 15549 . . . 4 (𝐹𝑟 𝐴 → dom 𝐹 ⊆ ℝ)
10 eqidd 2764 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ dom 𝐹) → (𝐹𝑧) = (𝐹𝑧))
118, 9, 10rlim 15542 . . 3 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
12 fssres 6744 . . . . . 6 ((𝐹:dom 𝐹⟶ℂ ∧ (dom 𝐹𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
138, 1, 12sylancl 597 . . . . 5 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
14 resres 5991 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹𝐵))
15 ffn 6705 . . . . . . . . 9 (𝐹:dom 𝐹⟶ℂ → 𝐹 Fn dom 𝐹)
16 fnresdm 6654 . . . . . . . . 9 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
178, 15, 163syl 19 . . . . . . . 8 (𝐹𝑟 𝐴 → (𝐹 ↾ dom 𝐹) = 𝐹)
1817reseq1d 5977 . . . . . . 7 (𝐹𝑟 𝐴 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹𝐵))
1914, 18eqtr3id 2812 . . . . . 6 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)) = (𝐹𝐵))
2019feq1d 6687 . . . . 5 (𝐹𝑟 𝐴 → ((𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ ↔ (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ))
2113, 20mpbid 235 . . . 4 (𝐹𝑟 𝐴 → (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ)
221, 9sstrid 3948 . . . 4 (𝐹𝑟 𝐴 → (dom 𝐹𝐵) ⊆ ℝ)
23 elinel2 4155 . . . . . 6 (𝑧 ∈ (dom 𝐹𝐵) → 𝑧𝐵)
2423fvresd 6901 . . . . 5 (𝑧 ∈ (dom 𝐹𝐵) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2524adantl 486 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ (dom 𝐹𝐵)) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2621, 22, 25rlim 15542 . . 3 (𝐹𝑟 𝐴 → ((𝐹𝐵) ⇝𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ (dom 𝐹𝐵)(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
277, 11, 263imtr4d 297 . 2 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴))
2827pm2.43i 53 1 (𝐹𝑟 𝐴 → (𝐹𝐵) ⇝𝑟 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089  cin 3904  wss 3905   class class class wbr 5109  dom cdm 5661  cres 5663   Fn wfn 6531  wf 6532  cfv 6536  (class class class)co 7410  cc 11093  cr 11094   < clt 11238  cle 11239  cmin 11436  +crp 13011  abscabs 15281  𝑟 crli 15532
This theorem was proved from 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-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152
This theorem 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-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-pm 8823  df-rlim 15536
This theorem is referenced by:  rlimres2  15608  pnt  27778
  Copyright terms: Public domain W3C validator