Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rebtwnz | Structured version Visualization version GIF version |
Description: There is a unique greatest integer less than or equal to a real number. Exercise 4 of [Apostol] p. 28. (Contributed by NM, 15-Nov-2004.) |
Ref | Expression |
---|---|
rebtwnz | ⊢ (𝐴 ∈ ℝ → ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | renegcl 11214 | . . 3 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
2 | zbtwnre 12615 | . . 3 ⊢ (-𝐴 ∈ ℝ → ∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1))) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ → ∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1))) |
4 | znegcl 12285 | . . . 4 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
5 | znegcl 12285 | . . . . 5 ⊢ (𝑦 ∈ ℤ → -𝑦 ∈ ℤ) | |
6 | zcn 12254 | . . . . . 6 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
7 | zcn 12254 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
8 | negcon2 11204 | . . . . . 6 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑦 = -𝑥 ↔ 𝑥 = -𝑦)) | |
9 | 6, 7, 8 | syl2an 595 | . . . . 5 ⊢ ((𝑦 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑦 = -𝑥 ↔ 𝑥 = -𝑦)) |
10 | 5, 9 | reuhyp 5338 | . . . 4 ⊢ (𝑦 ∈ ℤ → ∃!𝑥 ∈ ℤ 𝑦 = -𝑥) |
11 | breq2 5074 | . . . . 5 ⊢ (𝑦 = -𝑥 → (-𝐴 ≤ 𝑦 ↔ -𝐴 ≤ -𝑥)) | |
12 | breq1 5073 | . . . . 5 ⊢ (𝑦 = -𝑥 → (𝑦 < (-𝐴 + 1) ↔ -𝑥 < (-𝐴 + 1))) | |
13 | 11, 12 | anbi12d 630 | . . . 4 ⊢ (𝑦 = -𝑥 → ((-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
14 | 4, 10, 13 | reuxfr1 3682 | . . 3 ⊢ (∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1))) |
15 | zre 12253 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
16 | leneg 11408 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ -𝐴 ≤ -𝑥)) | |
17 | 16 | ancoms 458 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ -𝐴 ≤ -𝑥)) |
18 | peano2rem 11218 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 − 1) ∈ ℝ) | |
19 | ltneg 11405 | . . . . . . . . 9 ⊢ (((𝐴 − 1) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ -𝑥 < -(𝐴 − 1))) | |
20 | 18, 19 | sylan 579 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ -𝑥 < -(𝐴 − 1))) |
21 | 1re 10906 | . . . . . . . . 9 ⊢ 1 ∈ ℝ | |
22 | ltsubadd 11375 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ 𝐴 < (𝑥 + 1))) | |
23 | 21, 22 | mp3an2 1447 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ 𝐴 < (𝑥 + 1))) |
24 | recn 10892 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
25 | ax-1cn 10860 | . . . . . . . . . . 11 ⊢ 1 ∈ ℂ | |
26 | negsubdi 11207 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → -(𝐴 − 1) = (-𝐴 + 1)) | |
27 | 24, 25, 26 | sylancl 585 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → -(𝐴 − 1) = (-𝐴 + 1)) |
28 | 27 | adantr 480 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → -(𝐴 − 1) = (-𝐴 + 1)) |
29 | 28 | breq2d 5082 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (-𝑥 < -(𝐴 − 1) ↔ -𝑥 < (-𝐴 + 1))) |
30 | 20, 23, 29 | 3bitr3d 308 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴 < (𝑥 + 1) ↔ -𝑥 < (-𝐴 + 1))) |
31 | 17, 30 | anbi12d 630 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
32 | 15, 31 | sylan2 592 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ) → ((𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
33 | 32 | bicomd 222 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ) → ((-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)) ↔ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
34 | 33 | reubidva 3314 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃!𝑥 ∈ ℤ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
35 | 14, 34 | syl5bb 282 | . 2 ⊢ (𝐴 ∈ ℝ → (∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
36 | 3, 35 | mpbid 231 | 1 ⊢ (𝐴 ∈ ℝ → ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∃!wreu 3065 class class class wbr 5070 (class class class)co 7255 ℂcc 10800 ℝcr 10801 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 − cmin 11135 -cneg 11136 ℤcz 12249 |
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 |
This theorem is referenced by: flcl 13443 fllelt 13445 flflp1 13455 flbi 13464 ltflcei 35692 |
Copyright terms: Public domain | W3C validator |