pntlemc - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pntlemc		Structured version Visualization version GIF version

Theorem pntlemc 27512

Description: Lemma for pnt 27531. Closure for the constants used in the proof. For comparison with Equation 10.6.27 of [Shapiro], p. 434, 𝑈 is α, 𝐸 is ε, and 𝐾 is K. (Contributed by Mario Carneiro, 13-Apr-2016.)

**Hypotheses**
Ref	Expression
pntlem1.r	⊢ 𝑅 = (𝑎 ∈ ℝ⁺ ↦ ((ψ‘𝑎) − 𝑎))
pntlem1.a	⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
pntlem1.b	⊢ (𝜑 → 𝐵 ∈ ℝ⁺)
pntlem1.l	⊢ (𝜑 → 𝐿 ∈ (0(,)1))
pntlem1.d	⊢ 𝐷 = (𝐴 + 1)
pntlem1.f	⊢ 𝐹 = ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2)))
pntlem1.u	⊢ (𝜑 → 𝑈 ∈ ℝ⁺)
pntlem1.u2	⊢ (𝜑 → 𝑈 ≤ 𝐴)
pntlem1.e	⊢ 𝐸 = (𝑈 / 𝐷)
pntlem1.k	⊢ 𝐾 = (exp‘(𝐵 / 𝐸))

**Assertion**
Ref	Expression
pntlemc	⊢ (𝜑 → (𝐸 ∈ ℝ⁺ ∧ 𝐾 ∈ ℝ⁺ ∧ (𝐸 ∈ (0(,)1) ∧ 1 < 𝐾 ∧ (𝑈 − 𝐸) ∈ ℝ⁺)))

Distinct variable group: 𝐸,𝑎 Allowed substitution hints: 𝜑(𝑎) 𝐴(𝑎) 𝐵(𝑎) 𝐷(𝑎) 𝑅(𝑎) 𝑈(𝑎) 𝐹(𝑎) 𝐾(𝑎) 𝐿(𝑎)

**Proof of Theorem pntlemc**
Step	Hyp	Ref	Expression
1		pntlem1.e	. . 3 ⊢ 𝐸 = (𝑈 / 𝐷)
2		pntlem1.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ ℝ⁺)
3		pntlem1.r	. . . . . 6 ⊢ 𝑅 = (𝑎 ∈ ℝ⁺ ↦ ((ψ‘𝑎) − 𝑎))
4		pntlem1.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
5		pntlem1.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ⁺)
6		pntlem1.l	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ (0(,)1))
7		pntlem1.d	. . . . . 6 ⊢ 𝐷 = (𝐴 + 1)
8		pntlem1.f	. . . . . 6 ⊢ 𝐹 = ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2)))
9	3, 4, 5, 6, 7, 8	pntlemd 27511	. . . . 5 ⊢ (𝜑 → (𝐿 ∈ ℝ⁺ ∧ 𝐷 ∈ ℝ⁺ ∧ 𝐹 ∈ ℝ⁺))
10	9	simp2d 1143	. . . 4 ⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
11	2, 10	rpdivcld 13018	. . 3 ⊢ (𝜑 → (𝑈 / 𝐷) ∈ ℝ⁺)
12	1, 11	eqeltrid 2833	. 2 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
13		pntlem1.k	. . 3 ⊢ 𝐾 = (exp‘(𝐵 / 𝐸))
14	5, 12	rpdivcld 13018	. . . . 5 ⊢ (𝜑 → (𝐵 / 𝐸) ∈ ℝ⁺)
15	14	rpred 13001	. . . 4 ⊢ (𝜑 → (𝐵 / 𝐸) ∈ ℝ)
16	15	rpefcld 16079	. . 3 ⊢ (𝜑 → (exp‘(𝐵 / 𝐸)) ∈ ℝ⁺)
17	13, 16	eqeltrid 2833	. 2 ⊢ (𝜑 → 𝐾 ∈ ℝ⁺)
18	12	rpred 13001	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ℝ)
19	12	rpgt0d 13004	. . . 4 ⊢ (𝜑 → 0 < 𝐸)
20	2	rpred 13001	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ℝ)
21	4	rpred 13001	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
22	10	rpred 13001	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ℝ)
23		pntlem1.u2	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ≤ 𝐴)
24	21	ltp1d 12119	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 < (𝐴 + 1))
25	24, 7	breqtrrdi 5151	. . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐷)
26	20, 21, 22, 23, 25	lelttrd 11338	. . . . . . 7 ⊢ (𝜑 → 𝑈 < 𝐷)
27	10	rpcnd 13003	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ℂ)
28	27	mulridd 11197	. . . . . . 7 ⊢ (𝜑 → (𝐷 · 1) = 𝐷)
29	26, 28	breqtrrd 5137	. . . . . 6 ⊢ (𝜑 → 𝑈 < (𝐷 · 1))
30		1red 11181	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℝ)
31	20, 30, 10	ltdivmuld 13052	. . . . . 6 ⊢ (𝜑 → ((𝑈 / 𝐷) < 1 ↔ 𝑈 < (𝐷 · 1)))
32	29, 31	mpbird 257	. . . . 5 ⊢ (𝜑 → (𝑈 / 𝐷) < 1)
33	1, 32	eqbrtrid 5144	. . . 4 ⊢ (𝜑 → 𝐸 < 1)
34		0xr 11227	. . . . 5 ⊢ 0 ∈ ℝ^*
35		1xr 11239	. . . . 5 ⊢ 1 ∈ ℝ^*
36		elioo2 13353	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ 1 ∈ ℝ^*) → (𝐸 ∈ (0(,)1) ↔ (𝐸 ∈ ℝ ∧ 0 < 𝐸 ∧ 𝐸 < 1)))
37	34, 35, 36	mp2an 692	. . . 4 ⊢ (𝐸 ∈ (0(,)1) ↔ (𝐸 ∈ ℝ ∧ 0 < 𝐸 ∧ 𝐸 < 1))
38	18, 19, 33, 37	syl3anbrc 1344	. . 3 ⊢ (𝜑 → 𝐸 ∈ (0(,)1))
39		efgt1 16090	. . . . 5 ⊢ ((𝐵 / 𝐸) ∈ ℝ⁺ → 1 < (exp‘(𝐵 / 𝐸)))
40	14, 39	syl 17	. . . 4 ⊢ (𝜑 → 1 < (exp‘(𝐵 / 𝐸)))
41	40, 13	breqtrrdi 5151	. . 3 ⊢ (𝜑 → 1 < 𝐾)
42		1re 11180	. . . . . . . 8 ⊢ 1 ∈ ℝ
43		ltaddrp 12996	. . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝐴 ∈ ℝ⁺) → 1 < (1 + 𝐴))
44	42, 4, 43	sylancr 587	. . . . . . 7 ⊢ (𝜑 → 1 < (1 + 𝐴))
45	2	rpcnne0d 13010	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ∈ ℂ ∧ 𝑈 ≠ 0))
46		divid 11874	. . . . . . . 8 ⊢ ((𝑈 ∈ ℂ ∧ 𝑈 ≠ 0) → (𝑈 / 𝑈) = 1)
47	45, 46	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑈 / 𝑈) = 1)
48	4	rpcnd 13003	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
49		ax-1cn 11132	. . . . . . . . 9 ⊢ 1 ∈ ℂ
50		addcom 11366	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + 1) = (1 + 𝐴))
51	48, 49, 50	sylancl 586	. . . . . . . 8 ⊢ (𝜑 → (𝐴 + 1) = (1 + 𝐴))
52	7, 51	eqtrid 2777	. . . . . . 7 ⊢ (𝜑 → 𝐷 = (1 + 𝐴))
53	44, 47, 52	3brtr4d 5141	. . . . . 6 ⊢ (𝜑 → (𝑈 / 𝑈) < 𝐷)
54	20, 2, 10, 53	ltdiv23d 13068	. . . . 5 ⊢ (𝜑 → (𝑈 / 𝐷) < 𝑈)
55	1, 54	eqbrtrid 5144	. . . 4 ⊢ (𝜑 → 𝐸 < 𝑈)
56		difrp 12997	. . . . 5 ⊢ ((𝐸 ∈ ℝ ∧ 𝑈 ∈ ℝ) → (𝐸 < 𝑈 ↔ (𝑈 − 𝐸) ∈ ℝ⁺))
57	18, 20, 56	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐸 < 𝑈 ↔ (𝑈 − 𝐸) ∈ ℝ⁺))
58	55, 57	mpbid 232	. . 3 ⊢ (𝜑 → (𝑈 − 𝐸) ∈ ℝ⁺)
59	38, 41, 58	3jca 1128	. 2 ⊢ (𝜑 → (𝐸 ∈ (0(,)1) ∧ 1 < 𝐾 ∧ (𝑈 − 𝐸) ∈ ℝ⁺))
60	12, 17, 59	3jca 1128	1 ⊢ (𝜑 → (𝐸 ∈ ℝ⁺ ∧ 𝐾 ∈ ℝ⁺ ∧ (𝐸 ∈ (0(,)1) ∧ 1 < 𝐾 ∧ (𝑈 − 𝐸) ∈ ℝ⁺)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 class class class wbr 5109 ↦ cmpt 5190 ‘cfv 6513 (class class class)co 7389 ℂcc 11072 ℝcr 11073 0cc0 11074 1c1 11075 + caddc 11077 · cmul 11079 ℝ^*cxr 11213 < clt 11214 ≤ cle 11215 − cmin 11411 / cdiv 11841 2c2 12242 3c3 12243 cdc 12655 ℝ⁺crp 12957 (,)cioo 13312 ↑cexp 14032 expce 16033 ψcchp 27009

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-inf2 9600 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 ax-pre-sup 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-se 5594 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-isom 6522 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-er 8673 df-pm 8804 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-sup 9399 df-inf 9400 df-oi 9469 df-card 9898 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12188 df-2 12250 df-3 12251 df-4 12252 df-5 12253 df-6 12254 df-7 12255 df-8 12256 df-9 12257 df-n0 12449 df-z 12536 df-dec 12656 df-uz 12800 df-rp 12958 df-ioo 13316 df-ico 13318 df-fz 13475 df-fzo 13622 df-fl 13760 df-seq 13973 df-exp 14033 df-fac 14245 df-bc 14274 df-hash 14302 df-shft 15039 df-cj 15071 df-re 15072 df-im 15073 df-sqrt 15207 df-abs 15208 df-limsup 15443 df-clim 15460 df-rlim 15461 df-sum 15659 df-ef 16039

This theorem is referenced by: pntlema 27513 pntlemb 27514 pntlemg 27515 pntlemh 27516 pntlemq 27518 pntlemr 27519 pntlemj 27520 pntlemi 27521 pntlemf 27522 pntlemo 27524 pntleme 27525 pntlemp 27527

W3C validator