| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntlemd | Structured version Visualization version GIF version | ||
| Description: Lemma for pnt 27644. 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 13397 | . . . 4 ⊢ (0(,)1) ⊆ ℝ | |
| 2 | pntlem1.l | . . . 4 ⊢ (𝜑 → 𝐿 ∈ (0(,)1)) | |
| 3 | 1, 2 | sselid 3925 | . . 3 ⊢ (𝜑 → 𝐿 ∈ ℝ) |
| 4 | eliooord 13395 | . . . . 5 ⊢ (𝐿 ∈ (0(,)1) → (0 < 𝐿 ∧ 𝐿 < 1)) | |
| 5 | 2, 4 | syl 17 | . . . 4 ⊢ (𝜑 → (0 < 𝐿 ∧ 𝐿 < 1)) |
| 6 | 5 | simpld 497 | . . 3 ⊢ (𝜑 → 0 < 𝐿) |
| 7 | 3, 6 | elrpd 13020 | . 2 ⊢ (𝜑 → 𝐿 ∈ ℝ+) |
| 8 | pntlem1.d | . . 3 ⊢ 𝐷 = (𝐴 + 1) | |
| 9 | pntlem1.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 10 | 1rp 12983 | . . . 4 ⊢ 1 ∈ ℝ+ | |
| 11 | rpaddcl 13003 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 1 ∈ ℝ+) → (𝐴 + 1) ∈ ℝ+) | |
| 12 | 9, 10, 11 | sylancl 594 | . . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ+) |
| 13 | 8, 12 | eqeltrid 2856 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℝ+) |
| 14 | pntlem1.f | . . 3 ⊢ 𝐹 = ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2))) | |
| 15 | 1re 11167 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 16 | ltaddrp 13018 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝐴 ∈ ℝ+) → 1 < (1 + 𝐴)) | |
| 17 | 15, 9, 16 | sylancr 595 | . . . . . . 7 ⊢ (𝜑 → 1 < (1 + 𝐴)) |
| 18 | 9 | rpcnd 13025 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 19 | ax-1cn 11117 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 20 | addcom 11355 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + 1) = (1 + 𝐴)) | |
| 21 | 18, 19, 20 | sylancl 594 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 + 1) = (1 + 𝐴)) |
| 22 | 8, 21 | eqtrid 2799 | . . . . . . 7 ⊢ (𝜑 → 𝐷 = (1 + 𝐴)) |
| 23 | 17, 22 | breqtrrd 5118 | . . . . . 6 ⊢ (𝜑 → 1 < 𝐷) |
| 24 | 13 | recgt1d 13037 | . . . . . 6 ⊢ (𝜑 → (1 < 𝐷 ↔ (1 / 𝐷) < 1)) |
| 25 | 23, 24 | mpbid 234 | . . . . 5 ⊢ (𝜑 → (1 / 𝐷) < 1) |
| 26 | 13 | rprecred 13034 | . . . . . 6 ⊢ (𝜑 → (1 / 𝐷) ∈ ℝ) |
| 27 | difrp 13019 | . . . . . 6 ⊢ (((1 / 𝐷) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / 𝐷) < 1 ↔ (1 − (1 / 𝐷)) ∈ ℝ+)) | |
| 28 | 26, 15, 27 | sylancl 594 | . . . . 5 ⊢ (𝜑 → ((1 / 𝐷) < 1 ↔ (1 − (1 / 𝐷)) ∈ ℝ+)) |
| 29 | 25, 28 | mpbid 234 | . . . 4 ⊢ (𝜑 → (1 − (1 / 𝐷)) ∈ ℝ+) |
| 30 | 3nn0 12485 | . . . . . . . . 9 ⊢ 3 ∈ ℕ0 | |
| 31 | 2nn 12277 | . . . . . . . . 9 ⊢ 2 ∈ ℕ | |
| 32 | 30, 31 | decnncl 12698 | . . . . . . . 8 ⊢ ;32 ∈ ℕ |
| 33 | nnrp 12991 | . . . . . . . 8 ⊢ (;32 ∈ ℕ → ;32 ∈ ℝ+) | |
| 34 | 32, 33 | ax-mp 5 | . . . . . . 7 ⊢ ;32 ∈ ℝ+ |
| 35 | pntlem1.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ+) | |
| 36 | rpmulcl 13004 | . . . . . . 7 ⊢ ((;32 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (;32 · 𝐵) ∈ ℝ+) | |
| 37 | 34, 35, 36 | sylancr 595 | . . . . . 6 ⊢ (𝜑 → (;32 · 𝐵) ∈ ℝ+) |
| 38 | 7, 37 | rpdivcld 13040 | . . . . 5 ⊢ (𝜑 → (𝐿 / (;32 · 𝐵)) ∈ ℝ+) |
| 39 | 2z 12589 | . . . . . 6 ⊢ 2 ∈ ℤ | |
| 40 | rpexpcl 14079 | . . . . . 6 ⊢ ((𝐷 ∈ ℝ+ ∧ 2 ∈ ℤ) → (𝐷↑2) ∈ ℝ+) | |
| 41 | 13, 39, 40 | sylancl 594 | . . . . 5 ⊢ (𝜑 → (𝐷↑2) ∈ ℝ+) |
| 42 | 38, 41 | rpdivcld 13040 | . . . 4 ⊢ (𝜑 → ((𝐿 / (;32 · 𝐵)) / (𝐷↑2)) ∈ ℝ+) |
| 43 | 29, 42 | rpmulcld 13039 | . . 3 ⊢ (𝜑 → ((1 − (1 / 𝐷)) · ((𝐿 / (;32 · 𝐵)) / (𝐷↑2))) ∈ ℝ+) |
| 44 | 14, 43 | eqeltrid 2856 | . 2 ⊢ (𝜑 → 𝐹 ∈ ℝ+) |
| 45 | 7, 13, 44 | 3jca 1137 | 1 ⊢ (𝜑 → (𝐿 ∈ ℝ+ ∧ 𝐷 ∈ ℝ+ ∧ 𝐹 ∈ ℝ+)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 class class class wbr 5090 ↦ cmpt 5171 ‘cfv 6506 (class class class)co 7381 ℂcc 11057 ℝcr 11058 0cc0 11059 1c1 11060 + caddc 11062 · cmul 11064 < clt 11202 − cmin 11400 / cdiv 11830 ℕcn 12196 2c2 12258 3c3 12259 ℤcz 12554 ;cdc 12674 ℝ+crp 12979 (,)cioo 13335 ↑cexp 14060 ψcchp 27123 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-4 12268 df-5 12269 df-6 12270 df-7 12271 df-8 12272 df-9 12273 df-n0 12468 df-z 12555 df-dec 12675 df-uz 12826 df-rp 12980 df-ioo 13339 df-seq 14001 df-exp 14061 |
| This theorem is referenced by: pntlemc 27625 pntlema 27626 pntlemb 27627 pntlemq 27631 pntlemr 27632 pntlemj 27633 pntlemf 27635 pntlemo 27637 pntleml 27641 |
| Copyright terms: Public domain | W3C validator |