| 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 11494 | . . 3 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 2 | zbtwnre 12947 | . . 3 ⊢ (-𝐴 ∈ ℝ → ∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1))) | |
| 3 | 1, 2 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ → ∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1))) |
| 4 | znegcl 12606 | . . . 4 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
| 5 | znegcl 12606 | . . . . 5 ⊢ (𝑦 ∈ ℤ → -𝑦 ∈ ℤ) | |
| 6 | zcn 12573 | . . . . . 6 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
| 7 | zcn 12573 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 8 | negcon2 11484 | . . . . . 6 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑦 = -𝑥 ↔ 𝑥 = -𝑦)) | |
| 9 | 6, 7, 8 | syl2an 605 | . . . . 5 ⊢ ((𝑦 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑦 = -𝑥 ↔ 𝑥 = -𝑦)) |
| 10 | 5, 9 | reuhyp 5377 | . . . 4 ⊢ (𝑦 ∈ ℤ → ∃!𝑥 ∈ ℤ 𝑦 = -𝑥) |
| 11 | breq2 5104 | . . . . 5 ⊢ (𝑦 = -𝑥 → (-𝐴 ≤ 𝑦 ↔ -𝐴 ≤ -𝑥)) | |
| 12 | breq1 5103 | . . . . 5 ⊢ (𝑦 = -𝑥 → (𝑦 < (-𝐴 + 1) ↔ -𝑥 < (-𝐴 + 1))) | |
| 13 | 11, 12 | anbi12d 641 | . . . 4 ⊢ (𝑦 = -𝑥 → ((-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
| 14 | 4, 10, 13 | reuxfr1 3715 | . . 3 ⊢ (∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1))) |
| 15 | zre 12572 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
| 16 | leneg 11690 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ -𝐴 ≤ -𝑥)) | |
| 17 | 16 | ancoms 462 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ -𝐴 ≤ -𝑥)) |
| 18 | peano2rem 11498 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 − 1) ∈ ℝ) | |
| 19 | ltneg 11687 | . . . . . . . . 9 ⊢ (((𝐴 − 1) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ -𝑥 < -(𝐴 − 1))) | |
| 20 | 18, 19 | sylan 589 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ -𝑥 < -(𝐴 − 1))) |
| 21 | 1re 11181 | . . . . . . . . 9 ⊢ 1 ∈ ℝ | |
| 22 | ltsubadd 11657 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ 𝐴 < (𝑥 + 1))) | |
| 23 | 21, 22 | mp3an2 1470 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 − 1) < 𝑥 ↔ 𝐴 < (𝑥 + 1))) |
| 24 | recn 11163 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 25 | ax-1cn 11131 | . . . . . . . . . . 11 ⊢ 1 ∈ ℂ | |
| 26 | negsubdi 11487 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → -(𝐴 − 1) = (-𝐴 + 1)) | |
| 27 | 24, 25, 26 | sylancl 595 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → -(𝐴 − 1) = (-𝐴 + 1)) |
| 28 | 27 | adantr 484 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → -(𝐴 − 1) = (-𝐴 + 1)) |
| 29 | 28 | breq2d 5112 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (-𝑥 < -(𝐴 − 1) ↔ -𝑥 < (-𝐴 + 1))) |
| 30 | 20, 23, 29 | 3bitr3d 311 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴 < (𝑥 + 1) ↔ -𝑥 < (-𝐴 + 1))) |
| 31 | 17, 30 | anbi12d 641 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
| 32 | 15, 31 | sylan2 602 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ) → ((𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)) ↔ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)))) |
| 33 | 32 | bicomd 225 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ) → ((-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)) ↔ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
| 34 | 33 | reubidva 3381 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃!𝑥 ∈ ℤ (-𝐴 ≤ -𝑥 ∧ -𝑥 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
| 35 | 14, 34 | bitrid 285 | . 2 ⊢ (𝐴 ∈ ℝ → (∃!𝑦 ∈ ℤ (-𝐴 ≤ 𝑦 ∧ 𝑦 < (-𝐴 + 1)) ↔ ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1)))) |
| 36 | 3, 35 | mpbid 234 | 1 ⊢ (𝐴 ∈ ℝ → ∃!𝑥 ∈ ℤ (𝑥 ≤ 𝐴 ∧ 𝐴 < (𝑥 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ∃!wreu 3365 class class class wbr 5100 (class class class)co 7396 ℂcc 11071 ℝcr 11072 1c1 11074 + caddc 11076 < clt 11216 ≤ cle 11217 − cmin 11414 -cneg 11415 ℤcz 12568 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9388 df-inf 9389 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-n0 12482 df-z 12569 df-uz 12840 |
| This theorem is referenced by: flcl 13805 fllelt 13807 flflp1 13817 flbi 13826 ltflcei 38107 |
| Copyright terms: Public domain | W3C validator |