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 15468

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 11135	. . 3 ⊢ (𝜑 → 0 ∈ ℂ)
4	1, 2, 3	rlim2 15456	. 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝_𝑟 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥)))
5		subid1 11412	. . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 − 0) = 𝐵)
6	5	fveq2d 6838	. . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (abs‘(𝐵 − 0)) = (abs‘𝐵))
7	6	breq1d 5089	. . . . . . 7 ⊢ (𝐵 ∈ ℂ → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥))
8	7	imbi2d 341	. . . . . 6 ⊢ (𝐵 ∈ ℂ → ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
9	8	ralimi 3077	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 𝐵 ∈ ℂ → ∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
10		ralbi 3095	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ((𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)) → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
11	1, 9, 10	3syl 18	. . . 4 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
12	11	rexbidv 3164	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
13	12	ralbidv 3163	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))
14	4, 13	bitrd 280	1 ⊢ (𝜑 → ((𝑧 ∈ 𝐴 ↦ 𝐵) ⇝_𝑟 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘𝐵) < 𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∈ wcel 2119 ∀wral 3054 ∃wrex 3064 ⊆ wss 3890 class class class wbr 5079 ↦ cmpt 5160 ‘cfv 6492 (class class class)co 7363 ℂcc 11034 ℝcr 11035 0cc0 11036 < clt 11177 ≤ cle 11178 − cmin 11375 ℝ⁺crp 12940 abscabs 15194 ⇝_𝑟 crli 15445

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-er 8640 df-pm 8773 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-ltxr 11182 df-sub 11377 df-rlim 15449

This theorem is referenced by: o1rlimmul 15579 dvfsumrlim 26023 rlimcxp 26962

W3C validator