reclimc - Mathbox for Glauco Siliprandi

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

Theorem reclimc 44831

Description: Limit of the reciprocal of a function. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
reclimc.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
reclimc.g	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (1 / 𝐵))
reclimc.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (ℂ ∖ {0}))
reclimc.c	⊢ (𝜑 → 𝐶 ∈ (𝐹 lim_ℂ 𝐷))
reclimc.cne0	⊢ (𝜑 → 𝐶 ≠ 0)

**Assertion**
Ref	Expression
reclimc	⊢ (𝜑 → (1 / 𝐶) ∈ (𝐺 lim_ℂ 𝐷))

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

**Proof of Theorem reclimc**
Step	Hyp	Ref	Expression
1		eqid 2731	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐶 − 𝐵)) = (𝑥 ∈ 𝐴 ↦ (𝐶 − 𝐵))
2		eqid 2731	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐵 · 𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝐵 · 𝐶))
3		eqid 2731	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ ((𝐶 − 𝐵) / (𝐵 · 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((𝐶 − 𝐵) / (𝐵 · 𝐶)))
4		limccl 25725	. . . . . . 7 ⊢ (𝐹 lim_ℂ 𝐷) ⊆ ℂ
5		reclimc.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ (𝐹 lim_ℂ 𝐷))
6	4, 5	sselid 3980	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ℂ)
7	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
8		reclimc.b	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (ℂ ∖ {0}))
9	8	eldifad 3960	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
10	7, 9	subcld 11578	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 − 𝐵) ∈ ℂ)
11	9, 7	mulcld 11241	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 · 𝐶) ∈ ℂ)
12		eldifsni 4793	. . . . . . . . 9 ⊢ (𝐵 ∈ (ℂ ∖ {0}) → 𝐵 ≠ 0)
13	8, 12	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ≠ 0)
14		reclimc.cne0	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≠ 0)
15	14	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≠ 0)
16	9, 7, 13, 15	mulne0d 11873	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 · 𝐶) ≠ 0)
17	16	neneqd 2944	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ (𝐵 · 𝐶) = 0)
18		elsng 4642	. . . . . . 7 ⊢ ((𝐵 · 𝐶) ∈ ℂ → ((𝐵 · 𝐶) ∈ {0} ↔ (𝐵 · 𝐶) = 0))
19	11, 18	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐵 · 𝐶) ∈ {0} ↔ (𝐵 · 𝐶) = 0))
20	17, 19	mtbird 325	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ (𝐵 · 𝐶) ∈ {0})
21	11, 20	eldifd 3959	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 · 𝐶) ∈ (ℂ ∖ {0}))
22		eqid 2731	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶)
23		eqid 2731	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ -𝐵) = (𝑥 ∈ 𝐴 ↦ -𝐵)
24		eqid 2731	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐶 + -𝐵)) = (𝑥 ∈ 𝐴 ↦ (𝐶 + -𝐵))
25	9	negcld 11565	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℂ)
26		reclimc.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
27	26, 9, 5	limcmptdm 44813	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
28		limcrcl 25724	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝐹 lim_ℂ 𝐷) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐷 ∈ ℂ))
29	5, 28	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐷 ∈ ℂ))
30	29	simp3d 1143	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ℂ)
31	22, 27, 6, 30	constlimc 44802	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝐶) lim_ℂ 𝐷))
32	26, 23, 9, 5	neglimc 44825	. . . . . 6 ⊢ (𝜑 → -𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ -𝐵) lim_ℂ 𝐷))
33	22, 23, 24, 7, 25, 31, 32	addlimc 44826	. . . . 5 ⊢ (𝜑 → (𝐶 + -𝐶) ∈ ((𝑥 ∈ 𝐴 ↦ (𝐶 + -𝐵)) lim_ℂ 𝐷))
34	6	negidd 11568	. . . . 5 ⊢ (𝜑 → (𝐶 + -𝐶) = 0)
35	7, 9	negsubd 11584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 + -𝐵) = (𝐶 − 𝐵))
36	35	mpteq2dva 5248	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 + -𝐵)) = (𝑥 ∈ 𝐴 ↦ (𝐶 − 𝐵)))
37	36	oveq1d 7427	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐶 + -𝐵)) lim_ℂ 𝐷) = ((𝑥 ∈ 𝐴 ↦ (𝐶 − 𝐵)) lim_ℂ 𝐷))
38	33, 34, 37	3eltr3d 2846	. . . 4 ⊢ (𝜑 → 0 ∈ ((𝑥 ∈ 𝐴 ↦ (𝐶 − 𝐵)) lim_ℂ 𝐷))
39	26, 22, 2, 9, 7, 5, 31	mullimc 44794	. . . 4 ⊢ (𝜑 → (𝐶 · 𝐶) ∈ ((𝑥 ∈ 𝐴 ↦ (𝐵 · 𝐶)) lim_ℂ 𝐷))
40	6, 6, 14, 14	mulne0d 11873	. . . 4 ⊢ (𝜑 → (𝐶 · 𝐶) ≠ 0)
41	1, 2, 3, 10, 21, 38, 39, 40	0ellimcdiv 44827	. . 3 ⊢ (𝜑 → 0 ∈ ((𝑥 ∈ 𝐴 ↦ ((𝐶 − 𝐵) / (𝐵 · 𝐶))) lim_ℂ 𝐷))
42		1cnd 11216	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 1 ∈ ℂ)
43	42, 9, 42, 7, 13, 15	divsubdivd 12042	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((1 / 𝐵) − (1 / 𝐶)) = (((1 · 𝐶) − (1 · 𝐵)) / (𝐵 · 𝐶)))
44	7	mullidd 11239	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐶) = 𝐶)
45	9	mullidd 11239	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐵) = 𝐵)
46	44, 45	oveq12d 7430	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((1 · 𝐶) − (1 · 𝐵)) = (𝐶 − 𝐵))
47	46	oveq1d 7427	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((1 · 𝐶) − (1 · 𝐵)) / (𝐵 · 𝐶)) = ((𝐶 − 𝐵) / (𝐵 · 𝐶)))
48	43, 47	eqtr2d 2772	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐶 − 𝐵) / (𝐵 · 𝐶)) = ((1 / 𝐵) − (1 / 𝐶)))
49	48	mpteq2dva 5248	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐶 − 𝐵) / (𝐵 · 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶))))
50	49	oveq1d 7427	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ ((𝐶 − 𝐵) / (𝐵 · 𝐶))) lim_ℂ 𝐷) = ((𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶))) lim_ℂ 𝐷))
51	41, 50	eleqtrd 2834	. 2 ⊢ (𝜑 → 0 ∈ ((𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶))) lim_ℂ 𝐷))
52		reclimc.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (1 / 𝐵))
53		eqid 2731	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶)))
54	9, 13	reccld 11990	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 / 𝐵) ∈ ℂ)
55	6, 14	reccld 11990	. . 3 ⊢ (𝜑 → (1 / 𝐶) ∈ ℂ)
56	52, 53, 27, 54, 30, 55	ellimcabssub0 44795	. 2 ⊢ (𝜑 → ((1 / 𝐶) ∈ (𝐺 lim_ℂ 𝐷) ↔ 0 ∈ ((𝑥 ∈ 𝐴 ↦ ((1 / 𝐵) − (1 / 𝐶))) lim_ℂ 𝐷)))
57	51, 56	mpbird 257	1 ⊢ (𝜑 → (1 / 𝐶) ∈ (𝐺 lim_ℂ 𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ≠ wne 2939 ∖ cdif 3945 ⊆ wss 3948 {csn 4628 ↦ cmpt 5231 dom cdm 5676 ⟶wf 6539 (class class class)co 7412 ℂcc 11114 0cc0 11116 1c1 11117 + caddc 11119 · cmul 11121 − cmin 11451 -cneg 11452 / cdiv 11878 lim_ℂ climc 25712

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 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193 ax-pre-sup 11194

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 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 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-er 8709 df-map 8828 df-pm 8829 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fi 9412 df-sup 9443 df-inf 9444 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-div 11879 df-nn 12220 df-2 12282 df-3 12283 df-4 12284 df-5 12285 df-6 12286 df-7 12287 df-8 12288 df-9 12289 df-n0 12480 df-z 12566 df-dec 12685 df-uz 12830 df-q 12940 df-rp 12982 df-xneg 13099 df-xadd 13100 df-xmul 13101 df-fz 13492 df-seq 13974 df-exp 14035 df-cj 15053 df-re 15054 df-im 15055 df-sqrt 15189 df-abs 15190 df-struct 17087 df-slot 17122 df-ndx 17134 df-base 17152 df-plusg 17217 df-mulr 17218 df-starv 17219 df-tset 17223 df-ple 17224 df-ds 17226 df-unif 17227 df-rest 17375 df-topn 17376 df-topgen 17396 df-psmet 21226 df-xmet 21227 df-met 21228 df-bl 21229 df-mopn 21230 df-cnfld 21235 df-top 22717 df-topon 22734 df-topsp 22756 df-bases 22770 df-cnp 23053 df-xms 24147 df-ms 24148 df-limc 25716

This theorem is referenced by: divlimc 44834 fourierdlem62 45346

W3C validator