Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > flid | Structured version Visualization version GIF version |
Description: An integer is its own floor. (Contributed by NM, 15-Nov-2004.) |
Ref | Expression |
---|---|
flid | ⊢ (𝐴 ∈ ℤ → (⌊‘𝐴) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zre 11986 | . . 3 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
2 | flle 13170 | . . 3 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐴 ∈ ℤ → (⌊‘𝐴) ≤ 𝐴) |
4 | 1 | leidd 11206 | . . 3 ⊢ (𝐴 ∈ ℤ → 𝐴 ≤ 𝐴) |
5 | flge 13176 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ∈ ℤ) → (𝐴 ≤ 𝐴 ↔ 𝐴 ≤ (⌊‘𝐴))) | |
6 | 1, 5 | mpancom 686 | . . 3 ⊢ (𝐴 ∈ ℤ → (𝐴 ≤ 𝐴 ↔ 𝐴 ≤ (⌊‘𝐴))) |
7 | 4, 6 | mpbid 234 | . 2 ⊢ (𝐴 ∈ ℤ → 𝐴 ≤ (⌊‘𝐴)) |
8 | reflcl 13167 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ) | |
9 | 1, 8 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℤ → (⌊‘𝐴) ∈ ℝ) |
10 | 9, 1 | letri3d 10782 | . 2 ⊢ (𝐴 ∈ ℤ → ((⌊‘𝐴) = 𝐴 ↔ ((⌊‘𝐴) ≤ 𝐴 ∧ 𝐴 ≤ (⌊‘𝐴)))) |
11 | 3, 7, 10 | mpbir2and 711 | 1 ⊢ (𝐴 ∈ ℤ → (⌊‘𝐴) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 ‘cfv 6355 ℝcr 10536 ≤ cle 10676 ℤcz 11982 ⌊cfl 13161 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-uz 12245 df-fl 13163 |
This theorem is referenced by: flidm 13180 flidz 13181 ceilid 13220 fleqceilz 13223 zmod10 13256 bits0 15777 bitsp1e 15781 bitsuz 15823 phiprmpw 16113 fldivp1 16233 prmreclem4 16255 dvfsumlem1 24623 dvfsumlem3 24625 ppival2 25705 ppival2g 25706 chtprm 25730 chtnprm 25731 chpp1 25732 chtdif 25735 cht1 25742 chp1 25744 prmorcht 25755 logfaclbnd 25798 logfacbnd3 25799 logexprlim 25801 rplogsumlem2 26061 log2sumbnd 26120 logdivbnd 26132 pntrsumbnd 26142 pntrlog2bndlem1 26153 pntrlog2bndlem4 26156 chpvalz 31899 chtvalz 31900 dnizphlfeqhlf 33815 lefldiveq 41579 fourierdlem65 42476 zefldiv2ALTV 43846 bits0ALTV 43864 zefldiv2 44610 flnn0div2ge 44613 flnn0ohalf 44614 nnlog2ge0lt1 44646 logbpw2m1 44647 blenpw2 44658 blen1 44664 blen2 44665 blengt1fldiv2p1 44673 dignn0fr 44681 dig0 44686 digexp 44687 0dig2nn0e 44692 0dig2nn0o 44693 |
Copyright terms: Public domain | W3C validator |