| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntibndlem2a | Structured version Visualization version GIF version | ||
| Description: Lemma for pntibndlem2 27924. (Contributed by Mario Carneiro, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| pntibnd.r | ⊢ 𝑅 = (𝑎 ∈ ℝ+ ↦ ((ψ‘𝑎) − 𝑎)) |
| pntibndlem1.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| pntibndlem1.l | ⊢ 𝐿 = ((1 / 4) / (𝐴 + 3)) |
| pntibndlem3.2 | ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ (abs‘((𝑅‘𝑥) / 𝑥)) ≤ 𝐴) |
| pntibndlem3.3 | ⊢ (𝜑 → 𝐵 ∈ ℝ+) |
| pntibndlem3.k | ⊢ 𝐾 = (exp‘(𝐵 / (𝐸 / 2))) |
| pntibndlem3.c | ⊢ 𝐶 = ((2 · 𝐵) + (log‘2)) |
| pntibndlem3.4 | ⊢ (𝜑 → 𝐸 ∈ (0(,)1)) |
| pntibndlem3.6 | ⊢ (𝜑 → 𝑍 ∈ ℝ+) |
| pntibndlem2.10 | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| Ref | Expression |
|---|---|
| pntibndlem2a | ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁[,]((1 + (𝐿 · 𝐸)) · 𝑁))) → (𝑢 ∈ ℝ ∧ 𝑁 ≤ 𝑢 ∧ 𝑢 ≤ ((1 + (𝐿 · 𝐸)) · 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pntibndlem2.10 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 2 | 1 | nnred 12354 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 3 | 1red 11313 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 4 | ioossre 13542 | . . . . . . 7 ⊢ (0(,)1) ⊆ ℝ | |
| 5 | pntibnd.r | . . . . . . . 8 ⊢ 𝑅 = (𝑎 ∈ ℝ+ ↦ ((ψ‘𝑎) − 𝑎)) | |
| 6 | pntibndlem1.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 7 | pntibndlem1.l | . . . . . . . 8 ⊢ 𝐿 = ((1 / 4) / (𝐴 + 3)) | |
| 8 | 5, 6, 7 | pntibndlem1 27922 | . . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ (0(,)1)) |
| 9 | 4, 8 | sselid 3906 | . . . . . 6 ⊢ (𝜑 → 𝐿 ∈ ℝ) |
| 10 | pntibndlem3.4 | . . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ (0(,)1)) | |
| 11 | 4, 10 | sselid 3906 | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ ℝ) |
| 12 | 9, 11 | remulcld 11343 | . . . . 5 ⊢ (𝜑 → (𝐿 · 𝐸) ∈ ℝ) |
| 13 | 3, 12 | readdcld 11342 | . . . 4 ⊢ (𝜑 → (1 + (𝐿 · 𝐸)) ∈ ℝ) |
| 14 | 13, 2 | remulcld 11343 | . . 3 ⊢ (𝜑 → ((1 + (𝐿 · 𝐸)) · 𝑁) ∈ ℝ) |
| 15 | elicc2 13546 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ ((1 + (𝐿 · 𝐸)) · 𝑁) ∈ ℝ) → (𝑢 ∈ (𝑁[,]((1 + (𝐿 · 𝐸)) · 𝑁)) ↔ (𝑢 ∈ ℝ ∧ 𝑁 ≤ 𝑢 ∧ 𝑢 ≤ ((1 + (𝐿 · 𝐸)) · 𝑁)))) | |
| 16 | 2, 14, 15 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑢 ∈ (𝑁[,]((1 + (𝐿 · 𝐸)) · 𝑁)) ↔ (𝑢 ∈ ℝ ∧ 𝑁 ≤ 𝑢 ∧ 𝑢 ≤ ((1 + (𝐿 · 𝐸)) · 𝑁)))) |
| 17 | 16 | biimpa 482 | 1 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑁[,]((1 + (𝐿 · 𝐸)) · 𝑁))) → (𝑢 ∈ ℝ ∧ 𝑁 ≤ 𝑢 ∧ 𝑢 ≤ ((1 + (𝐿 · 𝐸)) · 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∀wral 3076 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6539 (class class class)co 7421 ℝcr 11203 0cc0 11204 1c1 11205 + caddc 11207 · cmul 11209 ≤ cle 11348 − cmin 11545 / cdiv 11977 ℕcn 12339 2c2 12401 3c3 12402 4c4 12403 ℝ+crp 13124 (,)cioo 13480 [,]cicc 13483 abscabs 15407 expce 16233 logclog 26888 ψcchp 27426 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-nn 12340 df-2 12409 df-3 12410 df-4 12411 df-rp 13125 df-ioo 13484 df-icc 13487 |
| This theorem is used by: pntibndlem2 27924 |
| Copyright terms: Public domain | W3C validator |