| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntlemd | Structured version Visualization version GIF version | ||
| Description: Lemma for pnt 27685. Closure for the constants used in the proof. For comparison with Equation 10.6.27 of [Shapiro], p. 434, 𝐴 is C^*, 𝐵 is c1, 𝐿 is λ, 𝐷 is c2, and 𝐹 is c3. (Contributed by Mario Carneiro, 13-Apr-2016.) |
| Ref | Expression |
|---|---|
| pntlem1.r | ⊢ 𝑅 = (𝑎 ∈ ℝ+ ↦ ((ψ‘𝑎) − 𝑎)) |
| pntlem1.a | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| pntlem1.b | ⊢ (𝜑 → 𝐵 ∈ ℝ+) |
| pntlem1.l | ⊢ (𝜑 → 𝐿 ∈ (0(,)1)) |
| pntlem1.d | ⊢ 𝐷 = (𝐴 + 1) |
| pntlem1.f | ⊢ 𝐹 = ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2))) |
| Ref | Expression |
|---|---|
| pntlemd | ⊢ (𝜑 → (𝐿 ∈ ℝ+ ∧ 𝐷 ∈ ℝ+ ∧ 𝐹 ∈ ℝ+)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ioossre 13421 | . . . 4 ⊢ (0(,)1) ⊆ ℝ | |
| 2 | pntlem1.l | . . . 4 ⊢ (𝜑 → 𝐿 ∈ (0(,)1)) | |
| 3 | 1, 2 | sselid 3935 | . . 3 ⊢ (𝜑 → 𝐿 ∈ ℝ) |
| 4 | eliooord 13419 | . . . . 5 ⊢ (𝐿 ∈ (0(,)1) → (0 < 𝐿 ∧ 𝐿 < 1)) | |
| 5 | 2, 4 | syl 17 | . . . 4 ⊢ (𝜑 → (0 < 𝐿 ∧ 𝐿 < 1)) |
| 6 | 5 | simpld 498 | . . 3 ⊢ (𝜑 → 0 < 𝐿) |
| 7 | 3, 6 | elrpd 13044 | . 2 ⊢ (𝜑 → 𝐿 ∈ ℝ+) |
| 8 | pntlem1.d | . . 3 ⊢ 𝐷 = (𝐴 + 1) | |
| 9 | pntlem1.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 10 | 1rp 13007 | . . . 4 ⊢ 1 ∈ ℝ+ | |
| 11 | rpaddcl 13027 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 1 ∈ ℝ+) → (𝐴 + 1) ∈ ℝ+) | |
| 12 | 9, 10, 11 | sylancl 595 | . . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ+) |
| 13 | 8, 12 | eqeltrid 2867 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℝ+) |
| 14 | pntlem1.f | . . 3 ⊢ 𝐹 = ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2))) | |
| 15 | 1re 11192 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 16 | ltaddrp 13042 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝐴 ∈ ℝ+) → 1 < (1 + 𝐴)) | |
| 17 | 15, 9, 16 | sylancr 596 | . . . . . . 7 ⊢ (𝜑 → 1 < (1 + 𝐴)) |
| 18 | 9 | rpcnd 13049 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 19 | ax-1cn 11142 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 20 | addcom 11380 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + 1) = (1 + 𝐴)) | |
| 21 | 18, 19, 20 | sylancl 595 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 + 1) = (1 + 𝐴)) |
| 22 | 8, 21 | eqtrid 2810 | . . . . . . 7 ⊢ (𝜑 → 𝐷 = (1 + 𝐴)) |
| 23 | 17, 22 | breqtrrd 5129 | . . . . . 6 ⊢ (𝜑 → 1 < 𝐷) |
| 24 | 13 | recgt1d 13061 | . . . . . 6 ⊢ (𝜑 → (1 < 𝐷 ↔ (1 / 𝐷) < 1)) |
| 25 | 23, 24 | mpbid 234 | . . . . 5 ⊢ (𝜑 → (1 / 𝐷) < 1) |
| 26 | 13 | rprecred 13058 | . . . . . 6 ⊢ (𝜑 → (1 / 𝐷) ∈ ℝ) |
| 27 | difrp 13043 | . . . . . 6 ⊢ (((1 / 𝐷) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / 𝐷) < 1 ↔ (1 − (1 / 𝐷)) ∈ ℝ+)) | |
| 28 | 26, 15, 27 | sylancl 595 | . . . . 5 ⊢ (𝜑 → ((1 / 𝐷) < 1 ↔ (1 − (1 / 𝐷)) ∈ ℝ+)) |
| 29 | 25, 28 | mpbid 234 | . . . 4 ⊢ (𝜑 → (1 − (1 / 𝐷)) ∈ ℝ+) |
| 30 | 3nn0 12509 | . . . . . . . . 9 ⊢ 3 ∈ ℕ0 | |
| 31 | 2nn 12301 | . . . . . . . . 9 ⊢ 2 ∈ ℕ | |
| 32 | 30, 31 | decnncl 12722 | . . . . . . . 8 ⊢ ;32 ∈ ℕ |
| 33 | nnrp 13015 | . . . . . . . 8 ⊢ (;32 ∈ ℕ → ;32 ∈ ℝ+) | |
| 34 | 32, 33 | ax-mp 5 | . . . . . . 7 ⊢ ;32 ∈ ℝ+ |
| 35 | pntlem1.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ+) | |
| 36 | rpmulcl 13028 | . . . . . . 7 ⊢ ((;32 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (;32 · 𝐵) ∈ ℝ+) | |
| 37 | 34, 35, 36 | sylancr 596 | . . . . . 6 ⊢ (𝜑 → (;32 · 𝐵) ∈ ℝ+) |
| 38 | 7, 37 | rpdivcld 13064 | . . . . 5 ⊢ (𝜑 → (𝐿 / (;32 · 𝐵)) ∈ ℝ+) |
| 39 | 2z 12613 | . . . . . 6 ⊢ 2 ∈ ℤ | |
| 40 | rpexpcl 14103 | . . . . . 6 ⊢ ((𝐷 ∈ ℝ+ ∧ 2 ∈ ℤ) → (𝐷↑2) ∈ ℝ+) | |
| 41 | 13, 39, 40 | sylancl 595 | . . . . 5 ⊢ (𝜑 → (𝐷↑2) ∈ ℝ+) |
| 42 | 38, 41 | rpdivcld 13064 | . . . 4 ⊢ (𝜑 → ((𝐿 / (;32 · 𝐵)) / (𝐷↑2)) ∈ ℝ+) |
| 43 | 29, 42 | rpmulcld 13063 | . . 3 ⊢ (𝜑 → ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2))) ∈ ℝ+) |
| 44 | 14, 43 | eqeltrid 2867 | . 2 ⊢ (𝜑 → 𝐹 ∈ ℝ+) |
| 45 | 7, 13, 44 | 3jca 1142 | 1 ⊢ (𝜑 → (𝐿 ∈ ℝ+ ∧ 𝐷 ∈ ℝ+ ∧ 𝐹 ∈ ℝ+)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 class class class wbr 5101 ↦ cmpt 5182 ‘cfv 6521 (class class class)co 7396 ℂcc 11082 ℝcr 11083 0cc0 11084 1c1 11085 + caddc 11087 · cmul 11089 < clt 11227 − cmin 11425 / cdiv 11855 ℕcn 12220 2c2 12282 3c3 12283 ℤcz 12578 ;cdc 12698 ℝ+crp 13003 (,)cioo 13359 ↑cexp 14084 ψcchp 27164 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-div 11856 df-nn 12221 df-2 12290 df-3 12291 df-4 12292 df-5 12293 df-6 12294 df-7 12295 df-8 12296 df-9 12297 df-n0 12492 df-z 12579 df-dec 12699 df-uz 12850 df-rp 13004 df-ioo 13363 df-seq 14025 df-exp 14085 |
| This theorem is referenced by: pntlemc 27666 pntlema 27667 pntlemb 27668 pntlemq 27672 pntlemr 27673 pntlemj 27674 pntlemf 27676 pntlemo 27678 pntleml 27682 |
| Copyright terms: Public domain | W3C validator |