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

Theorem rlimres 15493
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 4191 . . . . . . . 8 (dom 𝐹𝐵) ⊆ dom 𝐹
2 ssralv 4004 . . . . . . . 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 15436 . . . 4 (𝐹𝑟 𝐴𝐹:dom 𝐹⟶ℂ)
9 rlimss 15437 . . . 4 (𝐹𝑟 𝐴 → dom 𝐹 ⊆ ℝ)
10 eqidd 2738 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ dom 𝐹) → (𝐹𝑧) = (𝐹𝑧))
118, 9, 10rlim 15430 . . 3 (𝐹𝑟 𝐴 → (𝐹𝑟 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦𝑧 → (abs‘((𝐹𝑧) − 𝐴)) < 𝑥))))
12 fssres 6708 . . . . . 6 ((𝐹:dom 𝐹⟶ℂ ∧ (dom 𝐹𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
138, 1, 12sylancl 587 . . . . 5 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ)
14 resres 5959 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹𝐵))
15 ffn 6670 . . . . . . . . 9 (𝐹:dom 𝐹⟶ℂ → 𝐹 Fn dom 𝐹)
16 fnresdm 6619 . . . . . . . . 9 (𝐹 Fn dom 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
178, 15, 163syl 18 . . . . . . . 8 (𝐹𝑟 𝐴 → (𝐹 ↾ dom 𝐹) = 𝐹)
1817reseq1d 5945 . . . . . . 7 (𝐹𝑟 𝐴 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹𝐵))
1914, 18eqtr3id 2786 . . . . . 6 (𝐹𝑟 𝐴 → (𝐹 ↾ (dom 𝐹𝐵)) = (𝐹𝐵))
2019feq1d 6652 . . . . 5 (𝐹𝑟 𝐴 → ((𝐹 ↾ (dom 𝐹𝐵)):(dom 𝐹𝐵)⟶ℂ ↔ (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ))
2113, 20mpbid 232 . . . 4 (𝐹𝑟 𝐴 → (𝐹𝐵):(dom 𝐹𝐵)⟶ℂ)
221, 9sstrid 3947 . . . 4 (𝐹𝑟 𝐴 → (dom 𝐹𝐵) ⊆ ℝ)
23 elinel2 4156 . . . . . 6 (𝑧 ∈ (dom 𝐹𝐵) → 𝑧𝐵)
2423fvresd 6862 . . . . 5 (𝑧 ∈ (dom 𝐹𝐵) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2524adantl 481 . . . 4 ((𝐹𝑟 𝐴𝑧 ∈ (dom 𝐹𝐵)) → ((𝐹𝐵)‘𝑧) = (𝐹𝑧))
2621, 22, 25rlim 15430 . . 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 3902  wss 3903   class class class wbr 5100  dom cdm 5632  cres 5634   Fn wfn 6495  wf 6496  cfv 6500  (class class class)co 7368  cc 11036  cr 11037   < clt 11178  cle 11179  cmin 11376  +crp 12917  abscabs 15169  𝑟 crli 15420
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 5243  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095
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 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-pm 8778  df-rlim 15424
This theorem is referenced by:  rlimres2  15496  pnt  27593
  Copyright terms: Public domain W3C validator