| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntibndlem2a | Structured version Visualization version GIF version | ||
| Description: Lemma for pntibndlem2 27900. (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 12331 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 3 | 1red 11290 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 4 | ioossre 13519 | . . . . . . 7 ⊢ (0(,)1) ⊆ ℝ | |
| 5 | pntibnd.r | . . . . . . . 8 ⊢ 𝑅 = (𝑎 ∈ ℝ+ ↦ ((ψ‘𝑎) − 𝑎)) | |
| 6 | pntibndlem1.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 7 | pntibndlem1.l | . . . . . . . 8 ⊢ 𝐿 = ((1 / 4) / (𝐴 + 3)) | |
| 8 | 5, 6, 7 | pntibndlem1 27898 | . . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ (0(,)1)) |
| 9 | 4, 8 | sselid 3929 | . . . . . 6 ⊢ (𝜑 → 𝐿 ∈ ℝ) |
| 10 | pntibndlem3.4 | . . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ (0(,)1)) | |
| 11 | 4, 10 | sselid 3929 | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ ℝ) |
| 12 | 9, 11 | remulcld 11320 | . . . . 5 ⊢ (𝜑 → (𝐿 · 𝐸) ∈ ℝ) |
| 13 | 3, 12 | readdcld 11319 | . . . 4 ⊢ (𝜑 → (1 + (𝐿 · 𝐸)) ∈ ℝ) |
| 14 | 13, 2 | remulcld 11320 | . . 3 ⊢ (𝜑 → ((1 + (𝐿 · 𝐸)) · 𝑁) ∈ ℝ) |
| 15 | elicc2 13523 | . . 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 1570 ∈ wcel 2145 ∀wral 3077 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6531 (class class class)co 7412 ℝcr 11180 0cc0 11181 1c1 11182 + caddc 11184 · cmul 11186 ≤ cle 11325 − cmin 11522 / cdiv 11954 ℕcn 12316 2c2 12378 3c3 12379 4c4 12380 ℝ+crp 13101 (,)cioo 13457 [,]cicc 13460 abscabs 15381 expce 16207 logclog 26864 ψcchp 27402 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-rp 13102 df-ioo 13461 df-icc 13464 |
| This theorem is used by: pntibndlem2 27900 |
| Copyright terms: Public domain | W3C validator |