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

Theorem rlimcn1 15606
Description: Image of a limit under a continuous map. (Contributed by Mario Carneiro, 17-Sep-2014.)
Hypotheses
Ref Expression
rlimcn1.1 (𝜑𝐺:𝐴𝑋)
rlimcn1.2 (𝜑𝐶𝑋)
rlimcn1.3 (𝜑𝐺𝑟 𝐶)
rlimcn1.4 (𝜑𝐹:𝑋⟶ℂ)
rlimcn1.5 ((𝜑𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))
Assertion
Ref Expression
rlimcn1 (𝜑 → (𝐹𝐺) ⇝𝑟 (𝐹𝐶))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑧,𝐹,𝑦   𝑥,𝐺,𝑦,𝑧   𝜑,𝑥,𝑦   𝑥,𝐶,𝑦,𝑧   𝑧,𝑋
Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧)   𝑋(𝑥,𝑦)

Proof of Theorem rlimcn1
Dummy variables 𝑤 𝑐 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rlimcn1.1 . . . 4 (𝜑𝐺:𝐴𝑋)
21ffvelcdmda 7060 . . 3 ((𝜑𝑤𝐴) → (𝐺𝑤) ∈ 𝑋)
31feqmptd 6930 . . 3 (𝜑𝐺 = (𝑤𝐴 ↦ (𝐺𝑤)))
4 rlimcn1.4 . . . 4 (𝜑𝐹:𝑋⟶ℂ)
54feqmptd 6930 . . 3 (𝜑𝐹 = (𝑣𝑋 ↦ (𝐹𝑣)))
6 fveq2 6862 . . 3 (𝑣 = (𝐺𝑤) → (𝐹𝑣) = (𝐹‘(𝐺𝑤)))
72, 3, 5, 6fmptco 7106 . 2 (𝜑 → (𝐹𝐺) = (𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))))
8 rlimcn1.5 . . . . 5 ((𝜑𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))
9 fvexd 6877 . . . . . . . . 9 ((((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) ∧ 𝑤𝐴) → (𝐺𝑤) ∈ V)
109ralrimiva 3153 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∀𝑤𝐴 (𝐺𝑤) ∈ V)
11 simpr 488 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → 𝑦 ∈ ℝ+)
12 rlimcn1.3 . . . . . . . . . 10 (𝜑𝐺𝑟 𝐶)
133, 12eqbrtrrd 5121 . . . . . . . . 9 (𝜑 → (𝑤𝐴 ↦ (𝐺𝑤)) ⇝𝑟 𝐶)
1413ad2antrr 736 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (𝑤𝐴 ↦ (𝐺𝑤)) ⇝𝑟 𝐶)
1510, 11, 14rlimi 15531 . . . . . . 7 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦))
16 fvoveq1 7414 . . . . . . . . . . . . . 14 (𝑧 = (𝐺𝑤) → (abs‘(𝑧𝐶)) = (abs‘((𝐺𝑤) − 𝐶)))
1716breq1d 5107 . . . . . . . . . . . . 13 (𝑧 = (𝐺𝑤) → ((abs‘(𝑧𝐶)) < 𝑦 ↔ (abs‘((𝐺𝑤) − 𝐶)) < 𝑦))
1817imbrov2fvoveq 7416 . . . . . . . . . . . 12 (𝑧 = (𝐺𝑤) → (((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) ↔ ((abs‘((𝐺𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
19 simplrr 787 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))
202ad4ant14 762 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → (𝐺𝑤) ∈ 𝑋)
2118, 19, 20rspcdva 3581 . . . . . . . . . . 11 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ((abs‘((𝐺𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
2221imim2d 57 . . . . . . . . . 10 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ((𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2322ralimdva 3173 . . . . . . . . 9 (((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) → (∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2423reximdv 3176 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) → (∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2524expr 460 . . . . . . 7 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → (∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))))
2615, 25mpid 44 . . . . . 6 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2726rexlimdva 3162 . . . . 5 ((𝜑𝑥 ∈ ℝ+) → (∃𝑦 ∈ ℝ+𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
288, 27mpd 15 . . . 4 ((𝜑𝑥 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
2928ralrimiva 3153 . . 3 (𝜑 → ∀𝑥 ∈ ℝ+𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
304ffvelcdmda 7060 . . . . . 6 ((𝜑 ∧ (𝐺𝑤) ∈ 𝑋) → (𝐹‘(𝐺𝑤)) ∈ ℂ)
312, 30syldan 600 . . . . 5 ((𝜑𝑤𝐴) → (𝐹‘(𝐺𝑤)) ∈ ℂ)
3231ralrimiva 3153 . . . 4 (𝜑 → ∀𝑤𝐴 (𝐹‘(𝐺𝑤)) ∈ ℂ)
331fdmd 6697 . . . . 5 (𝜑 → dom 𝐺 = 𝐴)
34 rlimss 15520 . . . . . 6 (𝐺𝑟 𝐶 → dom 𝐺 ⊆ ℝ)
3512, 34syl 17 . . . . 5 (𝜑 → dom 𝐺 ⊆ ℝ)
3633, 35eqsstrrd 3969 . . . 4 (𝜑𝐴 ⊆ ℝ)
37 rlimcn1.2 . . . . 5 (𝜑𝐶𝑋)
384, 37ffvelcdmd 7061 . . . 4 (𝜑 → (𝐹𝐶) ∈ ℂ)
3932, 36, 38rlim2 15514 . . 3 (𝜑 → ((𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))) ⇝𝑟 (𝐹𝐶) ↔ ∀𝑥 ∈ ℝ+𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
4029, 39mpbird 259 . 2 (𝜑 → (𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))) ⇝𝑟 (𝐹𝐶))
417, 40eqbrtrd 5119 1 (𝜑 → (𝐹𝐺) ⇝𝑟 (𝐹𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  Vcvv 3453  wss 3902   class class class wbr 5097  cmpt 5178  dom cdm 5643  ccom 5647  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-nul 5253  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-csb 3851  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-mpt 5179  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-ima 5656  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:  rlimcn1b  15607  rlimdiv  15664
  Copyright terms: Public domain W3C validator