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

Theorem rlimcn1 15554
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 7056 . . 3 ((𝜑𝑤𝐴) → (𝐺𝑤) ∈ 𝑋)
31feqmptd 6929 . . 3 (𝜑𝐺 = (𝑤𝐴 ↦ (𝐺𝑤)))
4 rlimcn1.4 . . . 4 (𝜑𝐹:𝑋⟶ℂ)
54feqmptd 6929 . . 3 (𝜑𝐹 = (𝑣𝑋 ↦ (𝐹𝑣)))
6 fveq2 6858 . . 3 (𝑣 = (𝐺𝑤) → (𝐹𝑣) = (𝐹‘(𝐺𝑤)))
72, 3, 5, 6fmptco 7101 . 2 (𝜑 → (𝐹𝐺) = (𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))))
8 rlimcn1.5 . . . . 5 ((𝜑𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))
9 fvexd 6873 . . . . . . . . 9 ((((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) ∧ 𝑤𝐴) → (𝐺𝑤) ∈ V)
109ralrimiva 3125 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∀𝑤𝐴 (𝐺𝑤) ∈ V)
11 simpr 484 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → 𝑦 ∈ ℝ+)
12 rlimcn1.3 . . . . . . . . . 10 (𝜑𝐺𝑟 𝐶)
133, 12eqbrtrrd 5131 . . . . . . . . 9 (𝜑 → (𝑤𝐴 ↦ (𝐺𝑤)) ⇝𝑟 𝐶)
1413ad2antrr 726 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (𝑤𝐴 ↦ (𝐺𝑤)) ⇝𝑟 𝐶)
1510, 11, 14rlimi 15479 . . . . . . 7 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦))
16 fvoveq1 7410 . . . . . . . . . . . . . 14 (𝑧 = (𝐺𝑤) → (abs‘(𝑧𝐶)) = (abs‘((𝐺𝑤) − 𝐶)))
1716breq1d 5117 . . . . . . . . . . . . 13 (𝑧 = (𝐺𝑤) → ((abs‘(𝑧𝐶)) < 𝑦 ↔ (abs‘((𝐺𝑤) − 𝐶)) < 𝑦))
1817imbrov2fvoveq 7412 . . . . . . . . . . . 12 (𝑧 = (𝐺𝑤) → (((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) ↔ ((abs‘((𝐺𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
19 simplrr 777 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))
202ad4ant14 752 . . . . . . . . . . . 12 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → (𝐺𝑤) ∈ 𝑋)
2118, 19, 20rspcdva 3589 . . . . . . . . . . 11 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ((abs‘((𝐺𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
2221imim2d 57 . . . . . . . . . 10 ((((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) ∧ 𝑤𝐴) → ((𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2322ralimdva 3145 . . . . . . . . 9 (((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) → (∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2423reximdv 3148 . . . . . . . 8 (((𝜑𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥))) → (∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2524expr 456 . . . . . . 7 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → (∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐺𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))))
2615, 25mpid 44 . . . . . 6 (((𝜑𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
2726rexlimdva 3134 . . . . 5 ((𝜑𝑥 ∈ ℝ+) → (∃𝑦 ∈ ℝ+𝑧𝑋 ((abs‘(𝑧𝐶)) < 𝑦 → (abs‘((𝐹𝑧) − (𝐹𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
288, 27mpd 15 . . . 4 ((𝜑𝑥 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
2928ralrimiva 3125 . . 3 (𝜑 → ∀𝑥 ∈ ℝ+𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥))
304ffvelcdmda 7056 . . . . . 6 ((𝜑 ∧ (𝐺𝑤) ∈ 𝑋) → (𝐹‘(𝐺𝑤)) ∈ ℂ)
312, 30syldan 591 . . . . 5 ((𝜑𝑤𝐴) → (𝐹‘(𝐺𝑤)) ∈ ℂ)
3231ralrimiva 3125 . . . 4 (𝜑 → ∀𝑤𝐴 (𝐹‘(𝐺𝑤)) ∈ ℂ)
331fdmd 6698 . . . . 5 (𝜑 → dom 𝐺 = 𝐴)
34 rlimss 15468 . . . . . 6 (𝐺𝑟 𝐶 → dom 𝐺 ⊆ ℝ)
3512, 34syl 17 . . . . 5 (𝜑 → dom 𝐺 ⊆ ℝ)
3633, 35eqsstrrd 3982 . . . 4 (𝜑𝐴 ⊆ ℝ)
37 rlimcn1.2 . . . . 5 (𝜑𝐶𝑋)
384, 37ffvelcdmd 7057 . . . 4 (𝜑 → (𝐹𝐶) ∈ ℂ)
3932, 36, 38rlim2 15462 . . 3 (𝜑 → ((𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))) ⇝𝑟 (𝐹𝐶) ↔ ∀𝑥 ∈ ℝ+𝑐 ∈ ℝ ∀𝑤𝐴 (𝑐𝑤 → (abs‘((𝐹‘(𝐺𝑤)) − (𝐹𝐶))) < 𝑥)))
4029, 39mpbird 257 . 2 (𝜑 → (𝑤𝐴 ↦ (𝐹‘(𝐺𝑤))) ⇝𝑟 (𝐹𝐶))
417, 40eqbrtrd 5129 1 (𝜑 → (𝐹𝐺) ⇝𝑟 (𝐹𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wral 3044  wrex 3053  Vcvv 3447  wss 3914   class class class wbr 5107  cmpt 5188  dom cdm 5638  ccom 5642  wf 6507  cfv 6511  (class class class)co 7387  cc 11066  cr 11067   < clt 11208  cle 11209  cmin 11405  +crp 12951  abscabs 15200  𝑟 crli 15451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-pm 8802  df-rlim 15455
This theorem is referenced by:  rlimcn1b  15555  rlimdiv  15612
  Copyright terms: Public domain W3C validator