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 44418

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 11209	. . . 4 ⊢ (𝜑 → 0 ∈ ℂ)
3	1, 2	2thd 264	. . 3 ⊢ (𝜑 → (𝐶 ∈ ℂ ↔ 0 ∈ ℂ))
4		ellimcabssub0.b	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
5	1	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
6	4, 5	subcld 11573	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 − 𝐶) ∈ ℂ)
7		ellimcabssub0.g	. . . . . . . . . . . . 13 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐵 − 𝐶))
8	6, 7	fmptd 7115	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺:𝐴⟶ℂ)
9	8	ffvelcdmda 7086	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐺‘𝑧) ∈ ℂ)
10	9	subid1d 11562	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐺‘𝑧) − 0) = (𝐺‘𝑧))
11		simpr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
12		csbov1g 7456	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ V → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶))
13	12	elv 3480	. . . . . . . . . . . 12 ⊢ ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶)
14		sban 2083	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ ([𝑧 / 𝑥]𝜑 ∧ [𝑧 / 𝑥]𝑥 ∈ 𝐴))
15		nfv 1917	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥𝜑
16	15	sbf 2262	. . . . . . . . . . . . . . . . . 18 ⊢ ([𝑧 / 𝑥]𝜑 ↔ 𝜑)
17		clelsb1 2860	. . . . . . . . . . . . . . . . . 18 ⊢ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)
18	16, 17	anbi12i 627	. . . . . . . . . . . . . . . . 17 ⊢ (([𝑧 / 𝑥]𝜑 ∧ [𝑧 / 𝑥]𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑧 ∈ 𝐴))
19	14, 18	bitri 274	. . . . . . . . . . . . . . . 16 ⊢ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑧 ∈ 𝐴))
20	4	nfth 1803	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
21	20	sbf 2262	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥]((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ))
22		sbim 2299	. . . . . . . . . . . . . . . . 17 ⊢ ([𝑧 / 𝑥]((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
23	21, 22	sylbb1 236	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) → ([𝑧 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
24	19, 23	biimtrrid 242	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) → ((𝜑 ∧ 𝑧 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ))
25	4, 24	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → [𝑧 / 𝑥]𝐵 ∈ ℂ)
26		sbsbc 3781	. . . . . . . . . . . . . . 15 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ [𝑧 / 𝑥]𝐵 ∈ ℂ)
27		sbcel1g 4413	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ V → ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ))
28	27	elv 3480	. . . . . . . . . . . . . . 15 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
29	26, 28	bitri 274	. . . . . . . . . . . . . 14 ⊢ ([𝑧 / 𝑥]𝐵 ∈ ℂ ↔ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
30	25, 29	sylib 217	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ)
31	1	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝐶 ∈ ℂ)
32	30, 31	subcld 11573	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (⦋𝑧 / 𝑥⦌𝐵 − 𝐶) ∈ ℂ)
33	13, 32	eqeltrid 2837	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) ∈ ℂ)
34	7	fvmpts 7001	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝐴 ∧ ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) ∈ ℂ) → (𝐺‘𝑧) = ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶))
35	11, 33, 34	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐺‘𝑧) = ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶))
36		ellimcabssub0.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
37	36	fvmpts 7001	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐴 ∧ ⦋𝑧 / 𝑥⦌𝐵 ∈ ℂ) → (𝐹‘𝑧) = ⦋𝑧 / 𝑥⦌𝐵)
38	11, 30, 37	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = ⦋𝑧 / 𝑥⦌𝐵)
39	38	oveq1d 7426	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑧) − 𝐶) = (⦋𝑧 / 𝑥⦌𝐵 − 𝐶))
40	13, 39	eqtr4id 2791	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ⦋𝑧 / 𝑥⦌(𝐵 − 𝐶) = ((𝐹‘𝑧) − 𝐶))
41	10, 35, 40	3eqtrrd 2777	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑧) − 𝐶) = ((𝐺‘𝑧) − 0))
42	41	fveq2d 6895	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (abs‘((𝐹‘𝑧) − 𝐶)) = (abs‘((𝐺‘𝑧) − 0)))
43	42	breq1d 5158	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦 ↔ (abs‘((𝐺‘𝑧) − 0)) < 𝑦))
44	43	imbi2d 340	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
45	44	ralbidva 3175	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
46	45	rexbidv 3178	. . . 4 ⊢ (𝜑 → (∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
47	46	ralbidv 3177	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦) ↔ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦)))
48	3, 47	anbi12d 631	. 2 ⊢ (𝜑 → ((𝐶 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦)) ↔ (0 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐺‘𝑧) − 0)) < 𝑦))))
49	4, 36	fmptd 7115	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
50		ellimcabssub0.a	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
51		ellimcabssub0.p	. . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ)
52	49, 50, 51	ellimc3 25403	. 2 ⊢ (𝜑 → (𝐶 ∈ (𝐹 lim_ℂ 𝐷) ↔ (𝐶 ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑧 ∈ 𝐴 ((𝑧 ≠ 𝐷 ∧ (abs‘(𝑧 − 𝐷)) < 𝑤) → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑦))))
53	8, 50, 51	ellimc3 25403	. 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 396 = wceq 1541 [wsb 2067 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 Vcvv 3474 [wsbc 3777 ⦋csb 3893 ⊆ wss 3948 class class class wbr 5148 ↦ cmpt 5231 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 0cc0 11112 < clt 11250 − cmin 11446 ℝ⁺crp 12976 abscabs 15183 lim_ℂ climc 25386

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fi 9408 df-sup 9439 df-inf 9440 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-div 11874 df-nn 12215 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12475 df-z 12561 df-dec 12680 df-uz 12825 df-q 12935 df-rp 12977 df-xneg 13094 df-xadd 13095 df-xmul 13096 df-fz 13487 df-seq 13969 df-exp 14030 df-cj 15048 df-re 15049 df-im 15050 df-sqrt 15184 df-abs 15185 df-struct 17082 df-slot 17117 df-ndx 17129 df-base 17147 df-plusg 17212 df-mulr 17213 df-starv 17214 df-tset 17218 df-ple 17219 df-ds 17221 df-unif 17222 df-rest 17370 df-topn 17371 df-topgen 17391 df-psmet 20942 df-xmet 20943 df-met 20944 df-bl 20945 df-mopn 20946 df-cnfld 20951 df-top 22403 df-topon 22420 df-topsp 22442 df-bases 22456 df-cnp 22739 df-xms 23833 df-ms 23834 df-limc 25390

This theorem is referenced by: reclimc 44454

W3C validator