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 13375 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 < ((⌊‘𝐴) + 1)) | |
2 | 1 | adantr 484 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐴 < ((⌊‘𝐴) + 1)) |
3 | simpr 488 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
4 | 3 | zred 12282 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℝ) |
5 | simpl 486 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℝ) | |
6 | 5 | flcld 13373 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℤ) |
7 | 6 | peano2zd 12285 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℤ) |
8 | 7 | zred 12282 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℝ) |
9 | lelttr 10923 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((⌊‘𝐴) + 1) ∈ ℝ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) | |
10 | 4, 5, 8, 9 | syl3anc 1373 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) |
11 | 2, 10 | mpan2d 694 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 < ((⌊‘𝐴) + 1))) |
12 | zleltp1 12228 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) | |
13 | 3, 6, 12 | syl2anc 587 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) |
14 | 11, 13 | sylibrd 262 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 ≤ (⌊‘𝐴))) |
15 | flle 13374 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴) | |
16 | 15 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ≤ 𝐴) |
17 | 6 | zred 12282 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℝ) |
18 | letr 10926 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (⌊‘𝐴) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) | |
19 | 4, 17, 5, 18 | syl3anc 1373 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) |
20 | 16, 19 | mpan2d 694 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) → 𝐵 ≤ 𝐴)) |
21 | 14, 20 | impbid 215 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ (⌊‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2110 class class class wbr 5053 ‘cfv 6380 (class class class)co 7213 ℝcr 10728 1c1 10730 + caddc 10732 < clt 10867 ≤ cle 10868 ℤcz 12176 ⌊cfl 13365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 ax-pre-sup 10807 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-sup 9058 df-inf 9059 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-n0 12091 df-z 12177 df-uz 12439 df-fl 13367 |
This theorem is referenced by: fllt 13381 flid 13383 flwordi 13387 flval2 13389 flval3 13390 flge0nn0 13395 flge1nn 13396 flmulnn0 13402 btwnzge0 13403 fznnfl 13435 modmuladdnn0 13488 absrdbnd 14905 limsupgre 15042 climrlim2 15108 isprm7 16265 hashdvds 16328 prmreclem3 16471 ovolunlem1a 24393 mbfi1fseqlem4 24616 mbfi1fseqlem5 24617 dvfsumlem1 24923 dvfsumlem3 24925 ppisval 25986 dvdsflf1o 26069 ppiub 26085 chtub 26093 fsumvma2 26095 chpval2 26099 chpchtsum 26100 efexple 26162 bposlem3 26167 bposlem4 26168 bposlem5 26169 gausslemma2dlem4 26250 lgsquadlem1 26261 lgsquadlem2 26262 chebbnd1lem2 26351 chebbnd1lem3 26352 dchrisum0lem1 26397 pntrlog2bndlem6 26464 pntpbnd1 26467 pntpbnd2 26468 pntlemh 26480 pntlemj 26484 pntlemf 26486 aks4d1p1p2 39811 aks4d1p3 39819 dirkertrigeqlem3 43316 nnolog2flm1 45609 |
Copyright terms: Public domain | W3C validator |