rlim0 - Metamath Proof Explorer

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

Theorem rlim0 15433

Description: Express the predicate 𝐵(𝑧) converges to 0. (Contributed by Mario Carneiro, 16-Sep-2014.) (Revised by Mario Carneiro, 28-Feb-2015.)

**Hypotheses**
Ref	Expression
rlim0.1	⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ)
rlim0.2	⊢ (𝜑 → 𝐴 ⊆ ℝ)

**Assertion**
Ref	Expression
rlim0	⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝_𝑟 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))

Distinct variable groups: 𝑥,𝑦,𝑧,𝐴 𝑥,𝐵,𝑦 𝜑,𝑥,𝑦 Allowed substitution hints: 𝜑(𝑧) 𝐵(𝑧)

**Proof of Theorem rlim0**
Step	Hyp	Ref	Expression
1		rlim0.1	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ)
2		rlim0.2	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
3		0cnd 11127	. . 3 ⊢ (𝜑 → 0 ∈ ℂ)
4	1, 2, 3	rlim2 15421	. 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝_𝑟 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥)))
5		subid1 11402	. . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 − 0) = 𝐵)
6	5	fveq2d 6830	. . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (abs‘(𝐵 − 0)) = (abs‘𝐵))
7	6	breq1d 5105	. . . . . . 7 ⊢ (𝐵 ∈ ℂ → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥))
8	7	imbi2d 340	. . . . . 6 ⊢ (𝐵 ∈ ℂ → ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
9	8	ralimi 3066	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ → ∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
10		ralbi 3084	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)) → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
11	1, 9, 10	3syl 18	. . . 4 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
12	11	rexbidv 3153	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
13	12	ralbidv 3152	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
14	4, 13	bitrd 279	1 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝_𝑟 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 ⊆ wss 3905 class class class wbr 5095 ↦ cmpt 5176 ‘cfv 6486 (class class class)co 7353 ℂcc 11026 ℝcr 11027 0cc0 11028 < clt 11168 ≤ cle 11169 − cmin 11365 ℝ⁺crp 12911 abscabs 15159 ⇝_𝑟 crli 15410

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 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 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-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-po 5531 df-so 5532 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-er 8632 df-pm 8763 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-ltxr 11173 df-sub 11367 df-rlim 15414

This theorem is referenced by: o1rlimmul 15544 dvfsumrlim 25954 rlimcxp 26900

W3C validator