| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dchrisum0lem1a | Structured version Visualization version GIF version | ||
| Description: Lemma for dchrisum0lem1 27806. (Contributed by Mario Carneiro, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| dchrisum0lem1a | ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋 ≤ ((𝑋↑2) / 𝐷) ∧ (⌊‘((𝑋↑2) / 𝐷)) ∈ (ℤ≥‘(⌊‘𝑋)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfznn 13655 | . . . . . . 7 ⊢ (𝐷 ∈ (1...(⌊‘𝑋)) → 𝐷 ∈ ℕ) | |
| 2 | 1 | adantl 487 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝐷 ∈ ℕ) |
| 3 | 2 | nnred 12319 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝐷 ∈ ℝ) |
| 4 | simpr 490 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → 𝑋 ∈ ℝ+) | |
| 5 | 4 | rpregt0d 13139 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → (𝑋 ∈ ℝ ∧ 0 < 𝑋)) |
| 6 | 5 | adantr 486 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋 ∈ ℝ ∧ 0 < 𝑋)) |
| 7 | 6 | simpld 500 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝑋 ∈ ℝ) |
| 8 | 4 | adantr 486 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝑋 ∈ ℝ+) |
| 9 | 8 | rpge0d 13137 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 0 ≤ 𝑋) |
| 10 | 4 | rpred 13133 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → 𝑋 ∈ ℝ) |
| 11 | fznnfl 13970 | . . . . . . 7 ⊢ (𝑋 ∈ ℝ → (𝐷 ∈ (1...(⌊‘𝑋)) ↔ (𝐷 ∈ ℕ ∧ 𝐷 ≤ 𝑋))) | |
| 12 | 10, 11 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → (𝐷 ∈ (1...(⌊‘𝑋)) ↔ (𝐷 ∈ ℕ ∧ 𝐷 ≤ 𝑋))) |
| 13 | 12 | simplbda 505 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝐷 ≤ 𝑋) |
| 14 | 3, 7, 7, 9, 13 | lemul2ad 12226 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋 · 𝐷) ≤ (𝑋 · 𝑋)) |
| 15 | rpcn 13100 | . . . . . . 7 ⊢ (𝑋 ∈ ℝ+ → 𝑋 ∈ ℂ) | |
| 16 | 15 | adantl 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → 𝑋 ∈ ℂ) |
| 17 | 16 | sqvald 14254 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → (𝑋↑2) = (𝑋 · 𝑋)) |
| 18 | 17 | adantr 486 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋↑2) = (𝑋 · 𝑋)) |
| 19 | 14, 18 | breqtrrd 5132 | . . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋 · 𝐷) ≤ (𝑋↑2)) |
| 20 | 2z 12697 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
| 21 | rpexpcl 14191 | . . . . . . 7 ⊢ ((𝑋 ∈ ℝ+ ∧ 2 ∈ ℤ) → (𝑋↑2) ∈ ℝ+) | |
| 22 | 4, 20, 21 | sylancl 598 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → (𝑋↑2) ∈ ℝ+) |
| 23 | 22 | rpred 13133 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ+) → (𝑋↑2) ∈ ℝ) |
| 24 | 23 | adantr 486 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋↑2) ∈ ℝ) |
| 25 | 2 | nnrpd 13131 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝐷 ∈ ℝ+) |
| 26 | 7, 24, 25 | lemuldivd 13182 | . . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → ((𝑋 · 𝐷) ≤ (𝑋↑2) ↔ 𝑋 ≤ ((𝑋↑2) / 𝐷))) |
| 27 | 19, 26 | mpbid 235 | . 2 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → 𝑋 ≤ ((𝑋↑2) / 𝐷)) |
| 28 | nndivre 12348 | . . . 4 ⊢ (((𝑋↑2) ∈ ℝ ∧ 𝐷 ∈ ℕ) → ((𝑋↑2) / 𝐷) ∈ ℝ) | |
| 29 | 23, 1, 28 | syl2an 608 | . . 3 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → ((𝑋↑2) / 𝐷) ∈ ℝ) |
| 30 | flword2 13921 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ ((𝑋↑2) / 𝐷) ∈ ℝ ∧ 𝑋 ≤ ((𝑋↑2) / 𝐷)) → (⌊‘((𝑋↑2) / 𝐷)) ∈ (ℤ≥‘(⌊‘𝑋))) | |
| 31 | 7, 29, 27, 30 | syl3anc 1398 | . 2 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (⌊‘((𝑋↑2) / 𝐷)) ∈ (ℤ≥‘(⌊‘𝑋))) |
| 32 | 27, 31 | jca 521 | 1 ⊢ (((𝜑 ∧ 𝑋 ∈ ℝ+) ∧ 𝐷 ∈ (1...(⌊‘𝑋))) → (𝑋 ≤ ((𝑋↑2) / 𝐷) ∧ (⌊‘((𝑋↑2) / 𝐷)) ∈ (ℤ≥‘(⌊‘𝑋)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 class class class wbr 5102 ‘cfv 6527 (class class class)co 7408 ℂcc 11169 ℝcr 11170 0cc0 11171 1c1 11172 · cmul 11176 < clt 11314 ≤ cle 11315 / cdiv 11942 ℕcn 12304 2c2 12366 ℤcz 12662 ℤ≥cuz 12934 ℝ+crp 13089 ...cfz 13608 ⌊cfl 13898 ↑cexp 14172 |
| 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 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 ax-pre-sup 11249 |
| 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 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-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-sup 9412 df-inf 9413 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-div 11943 df-nn 12305 df-2 12374 df-n0 12576 df-z 12663 df-uz 12935 df-rp 13090 df-fz 13609 df-fl 13900 df-seq 14113 df-exp 14173 |
| This theorem is used by: dchrisum0lem1b 27805 dchrisum0lem1 27806 |
| Copyright terms: Public domain | W3C validator |