Theorem rlim3 14077

Description: Restrict the range of the domain bound to reals greater than some 𝐷 ∈ ℝ. (Contributed by Mario Carneiro, 16-Sep-2014.)

Hypotheses

Ref	Expression
rlim2.1	⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ)
rlim2.2	⊢ (𝜑 → 𝐴 ⊆ ℝ)
rlim2.3	⊢ (𝜑 → 𝐶 ∈ ℂ)
rlim3.4	⊢ (𝜑 → 𝐷 ∈ ℝ)

Assertion

Ref	Expression
rlim3	⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦   𝑦,𝐷,𝑧

Allowed substitution hints:   𝜑(𝑧)   𝐵(𝑧)   𝐷(𝑥)

Proof of Theorem rlim3

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rlim2.1	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ)
2		rlim2.2	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
3		rlim2.3	. . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ)
4	1, 2, 3	rlim2 14075	. . 3 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶 ↔ ∀𝑥 ∈ ℝ+ ∃𝑤 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
5		simpr 476	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → 𝑤 ∈ ℝ)
6		rlim3.4	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℝ)
7	6	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → 𝐷 ∈ ℝ)
8	5, 7	ifcld 4081	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ ℝ)
9		max1 11890	. . . . . . . 8 ⊢ ((𝐷 ∈ ℝ ∧ 𝑤 ∈ ℝ) → 𝐷 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))
10	6, 9	sylan 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → 𝐷 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))
11		elicopnf 12140	. . . . . . . 8 ⊢ (𝐷 ∈ ℝ → (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ (𝐷[,)+∞) ↔ (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ ℝ ∧ 𝐷 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))))
12	7, 11	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ (𝐷[,)+∞) ↔ (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ ℝ ∧ 𝐷 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))))
13	8, 10, 12	mpbir2and 959	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ (𝐷[,)+∞))
14	2, 6	jca 553	. . . . . . 7 ⊢ (𝜑 → (𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ))
15		simpllr 795	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → 𝐷 ∈ ℝ)
16		simplr 788	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → 𝑤 ∈ ℝ)
17		max2 11892	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ ℝ ∧ 𝑤 ∈ ℝ) → 𝑤 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))
18	15, 16, 17	syl2anc 691	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → 𝑤 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷))
19	16, 15	ifcld 4081	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ ℝ)
20		simpll 786	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) → 𝐴 ⊆ ℝ)
21	20	sselda 3568	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ ℝ)
22		letr 10010	. . . . . . . . . . 11 ⊢ ((𝑤 ∈ ℝ ∧ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ ℝ ∧ 𝑧 ∈ ℝ) → ((𝑤 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∧ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧) → 𝑤 ≤ 𝑧))
23	16, 19, 21, 22	syl3anc 1318	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → ((𝑤 ≤ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∧ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧) → 𝑤 ≤ 𝑧))
24	18, 23	mpand 707	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → 𝑤 ≤ 𝑧))
25	24	imim1d 80	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → ((𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
26	25	ralimdva 2945	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐷 ∈ ℝ) ∧ 𝑤 ∈ ℝ) → (∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∀𝑧 ∈ 𝐴 (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
27	14, 26	sylan 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∀𝑧 ∈ 𝐴 (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
28		breq1 4586	. . . . . . . . 9 ⊢ (𝑦 = if(𝐷 ≤ 𝑤, 𝑤, 𝐷) → (𝑦 ≤ 𝑧 ↔ if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧))
29	28	imbi1d 330	. . . . . . . 8 ⊢ (𝑦 = if(𝐷 ≤ 𝑤, 𝑤, 𝐷) → ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) ↔ (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
30	29	ralbidv 2969	. . . . . . 7 ⊢ (𝑦 = if(𝐷 ≤ 𝑤, 𝑤, 𝐷) → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
31	30	rspcev 3282	. . . . . 6 ⊢ ((if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ∈ (𝐷[,)+∞) ∧ ∀𝑧 ∈ 𝐴 (if(𝐷 ≤ 𝑤, 𝑤, 𝐷) ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)) → ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥))
32	13, 27, 31	syl6an 566	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
33	32	rexlimdva 3013	. . . 4 ⊢ (𝜑 → (∃𝑤 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
34	33	ralimdv 2946	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑤 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑤 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
35	4, 34	sylbid 229	. 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶 → ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
36		pnfxr 9971	. . . . . 6 ⊢ +∞ ∈ ℝ*
37		icossre 12125	. . . . . 6 ⊢ ((𝐷 ∈ ℝ ∧ +∞ ∈ ℝ*) → (𝐷[,)+∞) ⊆ ℝ)
38	6, 36, 37	sylancl 693	. . . . 5 ⊢ (𝜑 → (𝐷[,)+∞) ⊆ ℝ)
39		ssrexv 3630	. . . . 5 ⊢ ((𝐷[,)+∞) ⊆ ℝ → (∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
40	38, 39	syl 17	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
41	40	ralimdv 2946	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
42	1, 2, 3	rlim2 14075	. . 3 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
43	41, 42	sylibrd 248	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥) → (𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶))
44	35, 43	impbid 201	1 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝𝑟 𝐶 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ (𝐷[,)+∞)∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897   ⊆ wss 3540  ifcif 4036   class class class wbr 4583   ↦ cmpt 4643  ‘cfv 5804  (class class class)co 6549  ℂcc 9813  ℝcr 9814  +∞cpnf 9950  ℝ^*cxr 9952   < clt 9953   ≤ cle 9954   − cmin 10145  ℝ⁺crp 11708  [,)cico 12048  abscabs 13822   ⇝_𝑟 crli 14064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-pre-lttri 9889  ax-pre-lttrn 9890

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-er 7629  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-ico 12052  df-rlim 14068

This theorem is referenced by:  rlimresb  14144  rlimsqzlem  14227  rlimcnp  24492  signsply0  29954