![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > adddivflid | Structured version Visualization version GIF version |
Description: The floor of a sum of an integer and a fraction is equal to the integer iff the denominator of the fraction is less than the numerator. (Contributed by AV, 14-Jul-2021.) |
Ref | Expression |
---|---|
adddivflid | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 < 𝐶 ↔ (⌊‘(𝐴 + (𝐵 / 𝐶))) = 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1136 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℤ) | |
2 | nn0nndivcl 12480 | . . . . 5 ⊢ ((𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 / 𝐶) ∈ ℝ) | |
3 | 2 | 3adant1 1130 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 / 𝐶) ∈ ℝ) |
4 | 1, 3 | jca 512 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐴 ∈ ℤ ∧ (𝐵 / 𝐶) ∈ ℝ)) |
5 | flbi2 13714 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 / 𝐶) ∈ ℝ) → ((⌊‘(𝐴 + (𝐵 / 𝐶))) = 𝐴 ↔ (0 ≤ (𝐵 / 𝐶) ∧ (𝐵 / 𝐶) < 1))) | |
6 | 4, 5 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → ((⌊‘(𝐴 + (𝐵 / 𝐶))) = 𝐴 ↔ (0 ≤ (𝐵 / 𝐶) ∧ (𝐵 / 𝐶) < 1))) |
7 | nn0re 12418 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ0 → 𝐵 ∈ ℝ) | |
8 | nn0ge0 12434 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ0 → 0 ≤ 𝐵) | |
9 | 7, 8 | jca 512 | . . . . . 6 ⊢ (𝐵 ∈ ℕ0 → (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) |
10 | nnre 12156 | . . . . . . 7 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℝ) | |
11 | nngt0 12180 | . . . . . . 7 ⊢ (𝐶 ∈ ℕ → 0 < 𝐶) | |
12 | 10, 11 | jca 512 | . . . . . 6 ⊢ (𝐶 ∈ ℕ → (𝐶 ∈ ℝ ∧ 0 < 𝐶)) |
13 | 9, 12 | anim12i 613 | . . . . 5 ⊢ ((𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → ((𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶))) |
14 | 13 | 3adant1 1130 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → ((𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶))) |
15 | divge0 12020 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 0 ≤ (𝐵 / 𝐶)) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → 0 ≤ (𝐵 / 𝐶)) |
17 | 16 | biantrurd 533 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → ((𝐵 / 𝐶) < 1 ↔ (0 ≤ (𝐵 / 𝐶) ∧ (𝐵 / 𝐶) < 1))) |
18 | nnrp 12918 | . . . . 5 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℝ+) | |
19 | 7, 18 | anim12i 613 | . . . 4 ⊢ ((𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ+)) |
20 | 19 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ+)) |
21 | divlt1lt 12976 | . . 3 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ+) → ((𝐵 / 𝐶) < 1 ↔ 𝐵 < 𝐶)) | |
22 | 20, 21 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → ((𝐵 / 𝐶) < 1 ↔ 𝐵 < 𝐶)) |
23 | 6, 17, 22 | 3bitr2rd 307 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ0 ∧ 𝐶 ∈ ℕ) → (𝐵 < 𝐶 ↔ (⌊‘(𝐴 + (𝐵 / 𝐶))) = 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5103 ‘cfv 6493 (class class class)co 7353 ℝcr 11046 0cc0 11047 1c1 11048 + caddc 11050 < clt 11185 ≤ cle 11186 / cdiv 11808 ℕcn 12149 ℕ0cn0 12409 ℤcz 12495 ℝ+crp 12907 ⌊cfl 13687 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7668 ax-cnex 11103 ax-resscn 11104 ax-1cn 11105 ax-icn 11106 ax-addcl 11107 ax-addrcl 11108 ax-mulcl 11109 ax-mulrcl 11110 ax-mulcom 11111 ax-addass 11112 ax-mulass 11113 ax-distr 11114 ax-i2m1 11115 ax-1ne0 11116 ax-1rid 11117 ax-rnegex 11118 ax-rrecex 11119 ax-cnre 11120 ax-pre-lttri 11121 ax-pre-lttrn 11122 ax-pre-ltadd 11123 ax-pre-mulgt0 11124 ax-pre-sup 11125 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7309 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7799 df-2nd 7918 df-frecs 8208 df-wrecs 8239 df-recs 8313 df-rdg 8352 df-er 8644 df-en 8880 df-dom 8881 df-sdom 8882 df-sup 9374 df-inf 9375 df-pnf 11187 df-mnf 11188 df-xr 11189 df-ltxr 11190 df-le 11191 df-sub 11383 df-neg 11384 df-div 11809 df-nn 12150 df-n0 12410 df-z 12496 df-uz 12760 df-rp 12908 df-fl 13689 |
This theorem is referenced by: 2lgslem3a 26728 2lgslem3b 26729 2lgslem3c 26730 2lgslem3d 26731 |
Copyright terms: Public domain | W3C validator |