ellimcabssub0 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ellimcabssub0		Structured version Visualization version GIF version

Theorem ellimcabssub0 44633

Description: An equivalent condition for being a limit. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
ellimcabssub0.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
ellimcabssub0.g	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶))
ellimcabssub0.a	⊢ (𝜑 → 𝐴 ⊆ ℂ)
ellimcabssub0.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
ellimcabssub0.p	⊢ (𝜑 → 𝐷 ∈ ℂ)
ellimcabssub0.c	⊢ (𝜑 → 𝐶 ∈ ℂ)

**Assertion**
Ref	Expression
ellimcabssub0	⊢ (𝜑 → (𝐶 ∈ (𝐹 lim_ℂ 𝐷) ↔ 0 ∈ (𝐺 lim_ℂ 𝐷)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐶 𝜑,𝑥 Allowed substitution hints: 𝐵(𝑥) 𝐷(𝑥) 𝐹(𝑥) 𝐺(𝑥)

Proof of Theorem ellimcabssub0 Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ellimcabssub0.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ)
2		0cnd 11212	. . . 4 ⊢ (𝜑 → 0 ∈ ℂ)
3	1, 2	2thd 264	. . 3 ⊢ (𝜑 → (𝐶 ∈ ℂ ↔ 0 ∈ ℂ))
4		ellimcabssub0.b	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
5	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
6	4, 5	subcld 11576	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 − 𝐶) ∈ ℂ)
7		ellimcabssub0.g	. . . . . . . . . . . . 13 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶))
8	6, 7	fmptd 7116	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺:𝐴⟶ℂ)
9	8	ffvelcdmda 7087	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐺‘𝑧) ∈ ℂ)
10	9	subid1d 11565	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐺‘𝑧) − 0) = (𝐺‘𝑧))
11		simpr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
12		csbov1g 7457	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ V → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶))
13	12	elv 3479	. . . . . . . . . . . 12 ⊢ ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶)
14		sban 2082	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ ([𝑧 / 𝑥]𝜑 ∧ [𝑧 / 𝑥]𝑥 ∈ 𝐴))
15		nfv 1916	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥𝜑
16	15	sbf 2261	. . . . . . . . . . . . . . . . . 18 ⊢ ([𝑧 / 𝑥]𝜑 ↔ 𝜑)
17		clelsb1 2859	. . . . . . . . . . . . . . . . . 18 ⊢ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)
18	16, 17	anbi12i 626	. . . . . . . . . . . . . . . . 17 ⊢ (([𝑧 / 𝑥]𝜑 ∧ [𝑧 / 𝑥]𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑧 ∈ 𝐴))
19	14, 18	bitri 274	. . . . . . . . . . . . . . . 16 ⊢ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑧 ∈ 𝐴))
20	4	nfth 1802	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
21	20	sbf 2261	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥]((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ))
22		sbim 2298	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥]((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
23	21, 22	sylbb1 236	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) → ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
24	19, 23	biimtrrid 242	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) → ((𝜑 ∧ 𝑧 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
25	4, 24	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ)
26		sbsbc 3782	. . . . . . . . . . . . . . 15 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ [𝑧 / 𝑥]𝐵 ∈ ℂ)
27		sbcel1g 4414	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ V → ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ))
28	27	elv 3479	. . . . . . . . . . . . . . 15 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
29	26, 28	bitri 274	. . . . . . . . . . . . . 14 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
30	25, 29	sylib 217	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
31	1	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝐶 ∈ ℂ)
32	30, 31	subcld 11576	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (⦋𝑧 / 𝑥⦌𝐵 − 𝐶) ∈ ℂ)
33	13, 32	eqeltrid 2836	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) ∈ ℂ)
34	7	fvmpts 7002	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝐴 ∧ ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) ∈ ℂ) → (𝐺‘𝑧) = ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶))
35	11, 33, 34	syl2anc 583	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐺‘𝑧) = ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶))
36		ellimcabssub0.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
37	36	fvmpts 7002	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐴 ∧ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ) → (𝐹‘𝑧) = ⦋𝑧 / 𝑥⦌𝐵)
38	11, 30, 37	syl2anc 583	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = ⦋𝑧 / 𝑥⦌𝐵)
39	38	oveq1d 7427	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑧) − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶))
40	13, 39	eqtr4id 2790	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = ((𝐹‘𝑧) − 𝐶))
41	10, 35, 40	3eqtrrd 2776	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑧) − 𝐶) = ((𝐺‘𝑧) − 0))
42	41	fveq2d 6896	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (abs‘((𝐹‘𝑧) − 𝐶)) = (abs‘((𝐺‘𝑧) − 0)))
43	42	breq1d 5159	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦 ↔ (abs‘((𝐺‘𝑧) − 0)) < 𝑦))
44	43	imbi2d 339	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
45	44	ralbidva 3174	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
46	45	rexbidv 3177	. . . 4 ⊢ (𝜑 → (∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
47	46	ralbidv 3176	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
48	3, 47	anbi12d 630	. 2 ⊢ (𝜑 → ((𝐶 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦)) ↔ (0 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦))))
49	4, 36	fmptd 7116	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
50		ellimcabssub0.a	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
51		ellimcabssub0.p	. . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ)
52	49, 50, 51	ellimc3 25629	. 2 ⊢ (𝜑 → (𝐶 ∈ (𝐹 lim_ℂ 𝐷) ↔ (𝐶 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦))))
53	8, 50, 51	ellimc3 25629	. 2 ⊢ (𝜑 → (0 ∈ (𝐺 lim_ℂ 𝐷) ↔ (0 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦))))
54	48, 52, 53	3bitr4d 310	1 ⊢ (𝜑 → (𝐶 ∈ (𝐹 lim_ℂ 𝐷) ↔ 0 ∈ (𝐺 lim_ℂ 𝐷)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 [wsb 2066 ∈ wcel 2105 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 Vcvv 3473 [wsbc 3778 ⦋csb 3894 ⊆ wss 3949 class class class wbr 5149 ↦ cmpt 5232 ‘cfv 6544 (class class class)co 7412 ℂcc 11111 0cc0 11113 < clt 11253 − cmin 11449 ℝ⁺crp 12979 abscabs 15186 lim_ℂ climc 25612

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7728 ax-cnex 11169 ax-resscn 11170 ax-1cn 11171 ax-icn 11172 ax-addcl 11173 ax-addrcl 11174 ax-mulcl 11175 ax-mulrcl 11176 ax-mulcom 11177 ax-addass 11178 ax-mulass 11179 ax-distr 11180 ax-i2m1 11181 ax-1ne0 11182 ax-1rid 11183 ax-rnegex 11184 ax-rrecex 11185 ax-cnre 11186 ax-pre-lttri 11187 ax-pre-lttrn 11188 ax-pre-ltadd 11189 ax-pre-mulgt0 11190 ax-pre-sup 11191

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7859 df-1st 7978 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-1o 8469 df-er 8706 df-map 8825 df-pm 8826 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fi 9409 df-sup 9440 df-inf 9441 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-div 11877 df-nn 12218 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12478 df-z 12564 df-dec 12683 df-uz 12828 df-q 12938 df-rp 12980 df-xneg 13097 df-xadd 13098 df-xmul 13099 df-fz 13490 df-seq 13972 df-exp 14033 df-cj 15051 df-re 15052 df-im 15053 df-sqrt 15187 df-abs 15188 df-struct 17085 df-slot 17120 df-ndx 17132 df-base 17150 df-plusg 17215 df-mulr 17216 df-starv 17217 df-tset 17221 df-ple 17222 df-ds 17224 df-unif 17225 df-rest 17373 df-topn 17374 df-topgen 17394 df-psmet 21137 df-xmet 21138 df-met 21139 df-bl 21140 df-mopn 21141 df-cnfld 21146 df-top 22617 df-topon 22634 df-topsp 22656 df-bases 22670 df-cnp 22953 df-xms 24047 df-ms 24048 df-limc 25616

This theorem is referenced by: reclimc 44669

W3C validator