Theorem limcresi 15253

Description: Any limit of 𝐹 is also a limit of the restriction of 𝐹. (Contributed by Mario Carneiro, 28-Dec-2016.)

Assertion

Ref	Expression
limcresi	⊢ (𝐹 limℂ 𝐵) ⊆ ((𝐹 ↾ 𝐶) limℂ 𝐵)

Proof of Theorem limcresi

Dummy variables 𝑑 𝑒 𝑢 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limcrcl 15245	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐵 ∈ ℂ))
2	1	simp1d 1012	. . . . . 6 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → 𝐹:dom 𝐹⟶ℂ)
3	1	simp2d 1013	. . . . . 6 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → dom 𝐹 ⊆ ℂ)
4	1	simp3d 1014	. . . . . 6 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → 𝐵 ∈ ℂ)
5	2, 3, 4	ellimc3ap 15248	. . . . 5 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝑥 ∈ (𝐹 limℂ 𝐵) ↔ (𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒))))
6	5	ibi 176	. . . 4 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒)))
7		inss1 3401	. . . . . . . . 9 ⊢ (dom 𝐹 ∩ 𝐶) ⊆ dom 𝐹
8		ssralv 3265	. . . . . . . . 9 ⊢ ((dom 𝐹 ∩ 𝐶) ⊆ dom 𝐹 → (∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒)))
9	7, 8	ax-mp 5	. . . . . . . 8 ⊢ (∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒))
10		elinel2 3368	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ (dom 𝐹 ∩ 𝐶) → 𝑢 ∈ 𝐶)
11		fvres 5623	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑢) = (𝐹‘𝑢))
12	10, 11	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (dom 𝐹 ∩ 𝐶) → ((𝐹 ↾ 𝐶)‘𝑢) = (𝐹‘𝑢))
13	12	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (𝐹 limℂ 𝐵) ∧ 𝑢 ∈ (dom 𝐹 ∩ 𝐶)) → ((𝐹 ↾ 𝐶)‘𝑢) = (𝐹‘𝑢))
14	13	fvoveq1d 5989	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (𝐹 limℂ 𝐵) ∧ 𝑢 ∈ (dom 𝐹 ∩ 𝐶)) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) = (abs‘((𝐹‘𝑢) − 𝑥)))
15	14	breq1d 4069	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (𝐹 limℂ 𝐵) ∧ 𝑢 ∈ (dom 𝐹 ∩ 𝐶)) → ((abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒 ↔ (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒))
16	15	imbi2d 230	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (𝐹 limℂ 𝐵) ∧ 𝑢 ∈ (dom 𝐹 ∩ 𝐶)) → (((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒) ↔ ((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒)))
17	16	biimprd 158	. . . . . . . . 9 ⊢ ((𝑥 ∈ (𝐹 limℂ 𝐵) ∧ 𝑢 ∈ (dom 𝐹 ∩ 𝐶)) → (((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
18	17	ralimdva 2575	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
19	9, 18	syl5 32	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
20	19	reximdv 2609	. . . . . 6 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (∃𝑑 ∈ ℝ+ ∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
21	20	ralimdv 2576	. . . . 5 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒) → ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
22	21	anim2d 337	. . . 4 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → ((𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ dom 𝐹((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘((𝐹‘𝑢) − 𝑥)) < 𝑒)) → (𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒))))
23	6, 22	mpd 13	. . 3 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒)))
24		fresin 5476	. . . . 5 ⊢ (𝐹:dom 𝐹⟶ℂ → (𝐹 ↾ 𝐶):(dom 𝐹 ∩ 𝐶)⟶ℂ)
25	2, 24	syl 14	. . . 4 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝐹 ↾ 𝐶):(dom 𝐹 ∩ 𝐶)⟶ℂ)
26	7, 3	sstrid 3212	. . . 4 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (dom 𝐹 ∩ 𝐶) ⊆ ℂ)
27	25, 26, 4	ellimc3ap 15248	. . 3 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → (𝑥 ∈ ((𝐹 ↾ 𝐶) limℂ 𝐵) ↔ (𝑥 ∈ ℂ ∧ ∀𝑒 ∈ ℝ+ ∃𝑑 ∈ ℝ+ ∀𝑢 ∈ (dom 𝐹 ∩ 𝐶)((𝑢 # 𝐵 ∧ (abs‘(𝑢 − 𝐵)) < 𝑑) → (abs‘(((𝐹 ↾ 𝐶)‘𝑢) − 𝑥)) < 𝑒))))
28	23, 27	mpbird 167	. 2 ⊢ (𝑥 ∈ (𝐹 limℂ 𝐵) → 𝑥 ∈ ((𝐹 ↾ 𝐶) limℂ 𝐵))
29	28	ssriv 3205	1 ⊢ (𝐹 limℂ 𝐵) ⊆ ((𝐹 ↾ 𝐶) limℂ 𝐵)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1373   ∈ wcel 2178  ∀wral 2486  ∃wrex 2487   ∩ cin 3173   ⊆ wss 3174   class class class wbr 4059  dom cdm 4693   ↾ cres 4695  ⟶wf 5286  ‘cfv 5290  (class class class)co 5967  ℂcc 7958   < clt 8142   − cmin 8278   # cap 8689  ℝ⁺crp 9810  abscabs 11423   lim_ℂ climc 15241

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pm 6761  df-limced 15243

This theorem is referenced by:  dvidlemap  15278  dvidrelem  15279  dvidsslem  15280  dvcnp2cntop  15286  dvcoapbr  15294