Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > flge | Structured version Visualization version GIF version |
Description: The floor function value is the greatest integer less than or equal to its argument. (Contributed by NM, 15-Nov-2004.) (Proof shortened by Fan Zheng, 14-Jul-2016.) |
Ref | Expression |
---|---|
flge | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ (⌊‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | flltp1 13448 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 < ((⌊‘𝐴) + 1)) | |
2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐴 < ((⌊‘𝐴) + 1)) |
3 | simpr 484 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
4 | 3 | zred 12355 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℝ) |
5 | simpl 482 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℝ) | |
6 | 5 | flcld 13446 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℤ) |
7 | 6 | peano2zd 12358 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℤ) |
8 | 7 | zred 12355 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℝ) |
9 | lelttr 10996 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((⌊‘𝐴) + 1) ∈ ℝ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) | |
10 | 4, 5, 8, 9 | syl3anc 1369 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) |
11 | 2, 10 | mpan2d 690 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 < ((⌊‘𝐴) + 1))) |
12 | zleltp1 12301 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) | |
13 | 3, 6, 12 | syl2anc 583 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) |
14 | 11, 13 | sylibrd 258 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 ≤ (⌊‘𝐴))) |
15 | flle 13447 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴) | |
16 | 15 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ≤ 𝐴) |
17 | 6 | zred 12355 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℝ) |
18 | letr 10999 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (⌊‘𝐴) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) | |
19 | 4, 17, 5, 18 | syl3anc 1369 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) |
20 | 16, 19 | mpan2d 690 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) → 𝐵 ≤ 𝐴)) |
21 | 14, 20 | impbid 211 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ (⌊‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℝcr 10801 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 ℤcz 12249 ⌊cfl 13438 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fl 13440 |
This theorem is referenced by: fllt 13454 flid 13456 flwordi 13460 flval2 13462 flval3 13463 flge0nn0 13468 flge1nn 13469 flmulnn0 13475 btwnzge0 13476 fznnfl 13510 modmuladdnn0 13563 absrdbnd 14981 limsupgre 15118 climrlim2 15184 isprm7 16341 hashdvds 16404 prmreclem3 16547 ovolunlem1a 24565 mbfi1fseqlem4 24788 mbfi1fseqlem5 24789 dvfsumlem1 25095 dvfsumlem3 25097 ppisval 26158 dvdsflf1o 26241 ppiub 26257 chtub 26265 fsumvma2 26267 chpval2 26271 chpchtsum 26272 efexple 26334 bposlem3 26339 bposlem4 26340 bposlem5 26341 gausslemma2dlem4 26422 lgsquadlem1 26433 lgsquadlem2 26434 chebbnd1lem2 26523 chebbnd1lem3 26524 dchrisum0lem1 26569 pntrlog2bndlem6 26636 pntpbnd1 26639 pntpbnd2 26640 pntlemh 26652 pntlemj 26656 pntlemf 26658 aks4d1p1p2 40006 aks4d1p3 40014 aks4d1p6 40017 aks4d1p7d1 40018 aks4d1p7 40019 aks4d1p8 40023 aks4d1p9 40024 dirkertrigeqlem3 43531 nnolog2flm1 45824 |
Copyright terms: Public domain | W3C validator |