Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > flqmulnn0 | GIF version |
Description: Move a nonnegative integer in and out of a floor. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Ref | Expression |
---|---|
flqmulnn0 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (𝑁 · (⌊‘𝐴)) ≤ (⌊‘(𝑁 · 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | flqcl 10053 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (⌊‘𝐴) ∈ ℤ) | |
2 | 1 | adantl 275 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (⌊‘𝐴) ∈ ℤ) |
3 | 2 | zred 9180 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (⌊‘𝐴) ∈ ℝ) |
4 | qre 9424 | . . . 4 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
5 | 4 | adantl 275 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → 𝐴 ∈ ℝ) |
6 | simpl 108 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → 𝑁 ∈ ℕ0) | |
7 | 6 | nn0red 9038 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → 𝑁 ∈ ℝ) |
8 | 6 | nn0ge0d 9040 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → 0 ≤ 𝑁) |
9 | flqle 10058 | . . . 4 ⊢ (𝐴 ∈ ℚ → (⌊‘𝐴) ≤ 𝐴) | |
10 | 9 | adantl 275 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (⌊‘𝐴) ≤ 𝐴) |
11 | 3, 5, 7, 8, 10 | lemul2ad 8705 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (𝑁 · (⌊‘𝐴)) ≤ (𝑁 · 𝐴)) |
12 | nn0z 9081 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
13 | zq 9425 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℚ) | |
14 | 12, 13 | syl 14 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℚ) |
15 | qmulcl 9436 | . . . 4 ⊢ ((𝑁 ∈ ℚ ∧ 𝐴 ∈ ℚ) → (𝑁 · 𝐴) ∈ ℚ) | |
16 | 14, 15 | sylan 281 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (𝑁 · 𝐴) ∈ ℚ) |
17 | zmulcl 9114 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ) → (𝑁 · (⌊‘𝐴)) ∈ ℤ) | |
18 | 12, 1, 17 | syl2an 287 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (𝑁 · (⌊‘𝐴)) ∈ ℤ) |
19 | flqge 10062 | . . 3 ⊢ (((𝑁 · 𝐴) ∈ ℚ ∧ (𝑁 · (⌊‘𝐴)) ∈ ℤ) → ((𝑁 · (⌊‘𝐴)) ≤ (𝑁 · 𝐴) ↔ (𝑁 · (⌊‘𝐴)) ≤ (⌊‘(𝑁 · 𝐴)))) | |
20 | 16, 18, 19 | syl2anc 408 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → ((𝑁 · (⌊‘𝐴)) ≤ (𝑁 · 𝐴) ↔ (𝑁 · (⌊‘𝐴)) ≤ (⌊‘(𝑁 · 𝐴)))) |
21 | 11, 20 | mpbid 146 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℚ) → (𝑁 · (⌊‘𝐴)) ≤ (⌊‘(𝑁 · 𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 class class class wbr 3929 ‘cfv 5123 (class class class)co 5774 ℝcr 7626 · cmul 7632 ≤ cle 7808 ℕ0cn0 8984 ℤcz 9061 ℚcq 9418 ⌊cfl 10048 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7718 ax-resscn 7719 ax-1cn 7720 ax-1re 7721 ax-icn 7722 ax-addcl 7723 ax-addrcl 7724 ax-mulcl 7725 ax-mulrcl 7726 ax-addcom 7727 ax-mulcom 7728 ax-addass 7729 ax-mulass 7730 ax-distr 7731 ax-i2m1 7732 ax-0lt1 7733 ax-1rid 7734 ax-0id 7735 ax-rnegex 7736 ax-precex 7737 ax-cnre 7738 ax-pre-ltirr 7739 ax-pre-ltwlin 7740 ax-pre-lttrn 7741 ax-pre-apti 7742 ax-pre-ltadd 7743 ax-pre-mulgt0 7744 ax-pre-mulext 7745 ax-arch 7746 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-po 4218 df-iso 4219 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-pnf 7809 df-mnf 7810 df-xr 7811 df-ltxr 7812 df-le 7813 df-sub 7942 df-neg 7943 df-reap 8344 df-ap 8351 df-div 8440 df-inn 8728 df-n0 8985 df-z 9062 df-q 9419 df-rp 9449 df-fl 10050 |
This theorem is referenced by: modqmulnn 10122 |
Copyright terms: Public domain | W3C validator |