Theorem rlimcn1 14939

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.

Step	Hyp	Ref	Expression
1		rlimcn1.1	. . . 4 ⊢ (𝜑 → 𝐺:𝐴⟶𝑋)
2	1	ffvelrnda 6846	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑋)
3	1	feqmptd 6728	. . 3 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
4		rlimcn1.4	. . . 4 ⊢ (𝜑 → 𝐹:𝑋⟶ℂ)
5	4	feqmptd 6728	. . 3 ⊢ (𝜑 → 𝐹 = (𝑣 ∈ 𝑋 ↦ (𝐹‘𝑣)))
6		fveq2 6665	. . 3 ⊢ (𝑣 = (𝐺‘𝑤) → (𝐹‘𝑣) = (𝐹‘(𝐺‘𝑤)))
7	2, 3, 5, 6	fmptco 6886	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = (𝑤 ∈ 𝐴 ↦ (𝐹‘(𝐺‘𝑤))))
8		rlimcn1.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))
9		fvexd 6680	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ V)
10	9	ralrimiva 3182	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∀𝑤 ∈ 𝐴 (𝐺‘𝑤) ∈ V)
11		simpr 487	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → 𝑦 ∈ ℝ+)
12		rlimcn1.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ⇝𝑟 𝐶)
13	3, 12	eqbrtrrd 5083	. . . . . . . . 9 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)) ⇝𝑟 𝐶)
14	13	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)) ⇝𝑟 𝐶)
15	10, 11, 14	rlimi 14864	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦))
16		fvoveq1 7173	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝐺‘𝑤) → (abs‘(𝑧 − 𝐶)) = (abs‘((𝐺‘𝑤) − 𝐶)))
17	16	breq1d 5069	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝐺‘𝑤) → ((abs‘(𝑧 − 𝐶)) < 𝑦 ↔ (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦))
18	17	imbrov2fvoveq 7175	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐺‘𝑤) → (((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥) ↔ ((abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
19		simplrr 776	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) ∧ 𝑤 ∈ 𝐴) → ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))
20	2	ad4ant14 750	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑋)
21	18, 19, 20	rspcdva 3625	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) ∧ 𝑤 ∈ 𝐴) → ((abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥))
22	21	imim2d 57	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) ∧ 𝑤 ∈ 𝐴) → ((𝑐 ≤ 𝑤 → (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦) → (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
23	22	ralimdva 3177	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) → (∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦) → ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
24	23	reximdv 3273	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ (𝑦 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥))) → (∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
25	24	expr 459	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥) → (∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐺‘𝑤) − 𝐶)) < 𝑦) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥))))
26	15, 25	mpid 44	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ+) ∧ 𝑦 ∈ ℝ+) → (∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
27	26	rexlimdva 3284	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → (∃𝑦 ∈ ℝ+ ∀𝑧 ∈ 𝑋 ((abs‘(𝑧 − 𝐶)) < 𝑦 → (abs‘((𝐹‘𝑧) − (𝐹‘𝐶))) < 𝑥) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
28	8, 27	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ+) → ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥))
29	28	ralrimiva 3182	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥))
30	4	ffvelrnda 6846	. . . . . 6 ⊢ ((𝜑 ∧ (𝐺‘𝑤) ∈ 𝑋) → (𝐹‘(𝐺‘𝑤)) ∈ ℂ)
31	2, 30	syldan 593	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘(𝐺‘𝑤)) ∈ ℂ)
32	31	ralrimiva 3182	. . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝐴 (𝐹‘(𝐺‘𝑤)) ∈ ℂ)
33	1	fdmd 6518	. . . . 5 ⊢ (𝜑 → dom 𝐺 = 𝐴)
34		rlimss 14853	. . . . . 6 ⊢ (𝐺 ⇝𝑟 𝐶 → dom 𝐺 ⊆ ℝ)
35	12, 34	syl 17	. . . . 5 ⊢ (𝜑 → dom 𝐺 ⊆ ℝ)
36	33, 35	eqsstrrd 4006	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
37		rlimcn1.2	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
38	4, 37	ffvelrnd 6847	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ℂ)
39	32, 36, 38	rlim2 14847	. . 3 ⊢ (𝜑 → ((𝑤 ∈ 𝐴 ↦ (𝐹‘(𝐺‘𝑤))) ⇝𝑟 (𝐹‘𝐶) ↔ ∀𝑥 ∈ ℝ+ ∃𝑐 ∈ ℝ ∀𝑤 ∈ 𝐴 (𝑐 ≤ 𝑤 → (abs‘((𝐹‘(𝐺‘𝑤)) − (𝐹‘𝐶))) < 𝑥)))
40	29, 39	mpbird 259	. 2 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ (𝐹‘(𝐺‘𝑤))) ⇝𝑟 (𝐹‘𝐶))
41	7, 40	eqbrtrd 5081	1 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ⇝𝑟 (𝐹‘𝐶))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃wrex 3139  Vcvv 3495   ⊆ wss 3936   class class class wbr 5059   ↦ cmpt 5139  dom cdm 5550   ∘ ccom 5554  ⟶wf 6346  ‘cfv 6350  (class class class)co 7150  ℂcc 10529  ℝcr 10530   < clt 10669   ≤ cle 10670   − cmin 10864  ℝ⁺crp 12383  abscabs 14587   ⇝_𝑟 crli 14836

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-fv 6358  df-ov 7153  df-oprab 7154  df-mpo 7155  df-pm 8403  df-rlim 14840

This theorem is referenced by:  rlimcn1b  14940  rlimdiv  14996