cnplimclemle - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cnplimclemle		GIF version

Theorem cnplimclemle 14176

Description: Lemma for cnplimccntop 14178. Satisfying the epsilon condition for continuity. (Contributed by Mario Carneiro and Jim Kingdon, 17-Nov-2023.)

**Hypotheses**
Ref	Expression
cnplimccntop.k	⊢ 𝐾 = (MetOpen‘(abs ∘ − ))
cnplimc.j	⊢ 𝐽 = (𝐾 ↾_t 𝐴)
cnplimclemr.a	⊢ (𝜑 → 𝐴 ⊆ ℂ)
cnplimclemr.f	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
cnplimclemr.b	⊢ (𝜑 → 𝐵 ∈ 𝐴)
cnplimclemr.l	⊢ (𝜑 → (𝐹‘𝐵) ∈ (𝐹 lim_ℂ 𝐵))
cnplimclemle.e	⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
cnplimclemle.d	⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
cnplimclemle.z	⊢ (𝜑 → 𝑍 ∈ 𝐴)
cnplimclemle.im	⊢ ((𝜑 ∧ 𝑍 # 𝐵 ∧ (abs‘(𝑍 − 𝐵)) < 𝐷) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < (𝐸 / 2))
cnplimclemle.zd	⊢ (𝜑 → (abs‘(𝑍 − 𝐵)) < 𝐷)

**Assertion**
Ref	Expression
cnplimclemle	⊢ (𝜑 → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)

**Proof of Theorem cnplimclemle**
Step	Hyp	Ref	Expression
1		simpr 110	. . 3 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))))
2		cnplimclemr.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
3		cnplimclemle.z	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝐴)
4	2, 3	ffvelcdmd 5654	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑍) ∈ ℂ)
5		cnplimclemr.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
6	2, 5	ffvelcdmd 5654	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝐵) ∈ ℂ)
7	4, 6	subcld 8270	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝑍) − (𝐹‘𝐵)) ∈ ℂ)
8	7	abscld 11192	. . . . 5 ⊢ (𝜑 → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∈ ℝ)
9	8	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∈ ℝ)
10		cnplimclemle.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
11	10	rphalfcld 9711	. . . . . 6 ⊢ (𝜑 → (𝐸 / 2) ∈ ℝ⁺)
12	11	rpred 9698	. . . . 5 ⊢ (𝜑 → (𝐸 / 2) ∈ ℝ)
13	12	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝐸 / 2) ∈ ℝ)
14	4	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝐹‘𝑍) ∈ ℂ)
15	1	adantr 276	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))))
16		simpll 527	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → 𝜑)
17	16, 8	syl 14	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∈ ℝ)
18	16, 12	syl 14	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → (𝐸 / 2) ∈ ℝ)
19		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → 𝑍 # 𝐵)
20		cnplimclemle.zd	. . . . . . . . . . . . 13 ⊢ (𝜑 → (abs‘(𝑍 − 𝐵)) < 𝐷)
21	16, 20	syl 14	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → (abs‘(𝑍 − 𝐵)) < 𝐷)
22		cnplimclemle.im	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑍 # 𝐵 ∧ (abs‘(𝑍 − 𝐵)) < 𝐷) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < (𝐸 / 2))
23	16, 19, 21, 22	syl3anc 1238	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < (𝐸 / 2))
24	17, 18, 23	ltnsymd 8079	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) ∧ 𝑍 # 𝐵) → ¬ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))))
25	15, 24	pm2.65da 661	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → ¬ 𝑍 # 𝐵)
26		cnplimclemr.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
27	26, 3	sseldd 3158	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ ℂ)
28	26, 5	sseldd 3158	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℂ)
29	28	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → 𝐵 ∈ ℂ)
30		apti 8581	. . . . . . . . . 10 ⊢ ((𝑍 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑍 = 𝐵 ↔ ¬ 𝑍 # 𝐵))
31	27, 29, 30	syl2an2r 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝑍 = 𝐵 ↔ ¬ 𝑍 # 𝐵))
32	25, 31	mpbird 167	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → 𝑍 = 𝐵)
33	32	fveq2d 5521	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝐹‘𝑍) = (𝐹‘𝐵))
34	14, 33	subeq0bd 8338	. . . . . 6 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → ((𝐹‘𝑍) − (𝐹‘𝐵)) = 0)
35	34	abs00bd 11077	. . . . 5 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) = 0)
36	11	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (𝐸 / 2) ∈ ℝ⁺)
37	36	rpgt0d 9701	. . . . 5 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → 0 < (𝐸 / 2))
38	35, 37	eqbrtrd 4027	. . . 4 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < (𝐸 / 2))
39	9, 13, 38	ltnsymd 8079	. . 3 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → ¬ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))))
40	1, 39	pm2.21dd 620	. 2 ⊢ ((𝜑 ∧ (𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵)))) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)
41		simpr 110	. 2 ⊢ ((𝜑 ∧ (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸) → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)
42		rphalflt 9685	. . . 4 ⊢ (𝐸 ∈ ℝ⁺ → (𝐸 / 2) < 𝐸)
43	10, 42	syl 14	. . 3 ⊢ (𝜑 → (𝐸 / 2) < 𝐸)
44	10	rpred 9698	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ℝ)
45		axltwlin 8027	. . . 4 ⊢ (((𝐸 / 2) ∈ ℝ ∧ 𝐸 ∈ ℝ ∧ (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∈ ℝ) → ((𝐸 / 2) < 𝐸 → ((𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∨ (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)))
46	12, 44, 8, 45	syl3anc 1238	. . 3 ⊢ (𝜑 → ((𝐸 / 2) < 𝐸 → ((𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∨ (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)))
47	43, 46	mpd 13	. 2 ⊢ (𝜑 → ((𝐸 / 2) < (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) ∨ (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸))
48	40, 41, 47	mpjaodan 798	1 ⊢ (𝜑 → (abs‘((𝐹‘𝑍) − (𝐹‘𝐵))) < 𝐸)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ⊆ wss 3131 class class class wbr 4005 ∘ ccom 4632 ⟶wf 5214 ‘cfv 5218 (class class class)co 5877 ℂcc 7811 ℝcr 7812 0cc0 7813 < clt 7994 − cmin 8130 # cap 8540 / cdiv 8631 2c2 8972 ℝ⁺crp 9655 abscabs 11008 ↾_t crest 12693 MetOpencmopn 13484 lim_ℂ climc 14162

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-mulrcl 7912 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-precex 7923 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 ax-pre-mulgt0 7930 ax-pre-mulext 7931 ax-arch 7932 ax-caucvg 7933

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-recs 6308 df-frec 6394 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-reap 8534 df-ap 8541 df-div 8632 df-inn 8922 df-2 8980 df-3 8981 df-4 8982 df-n0 9179 df-z 9256 df-uz 9531 df-rp 9656 df-seqfrec 10448 df-exp 10522 df-cj 10853 df-re 10854 df-im 10855 df-rsqrt 11009 df-abs 11010

This theorem is referenced by: cnplimclemr 14177

W3C validator