| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > btwnz | Structured version Visualization version GIF version | ||
| Description: Any real number can be sandwiched between two integers. Exercise 2 of [Apostol] p. 28. (Contributed by NM, 10-Nov-2004.) |
| Ref | Expression |
|---|---|
| btwnz | ⊢ (𝐴 ∈ ℝ → (∃𝑥 ∈ ℤ 𝑥 < 𝐴 ∧ ∃𝑦 ∈ ℤ 𝐴 < 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | renegcl 11614 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 2 | arch 12596 | . . . 4 ⊢ (-𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) |
| 4 | nnre 12335 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ) | |
| 5 | ltnegcon1 11810 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴)) | |
| 6 | 5 | ex 418 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℝ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
| 7 | 4, 6 | syl5 35 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
| 8 | 7 | pm5.32d 588 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) ↔ (𝑧 ∈ ℕ ∧ -𝑧 < 𝐴))) |
| 9 | nnnegz 12689 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ → -𝑧 ∈ ℤ) | |
| 10 | breq1 5106 | . . . . . . . 8 ⊢ (𝑥 = -𝑧 → (𝑥 < 𝐴 ↔ -𝑧 < 𝐴)) | |
| 11 | 10 | rspcev 3577 | . . . . . . 7 ⊢ ((-𝑧 ∈ ℤ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 12 | 9, 11 | sylan 592 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 13 | 8, 12 | biimtrdi 256 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
| 14 | 13 | expd 421 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴))) |
| 15 | 14 | rexlimdv 3162 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃𝑧 ∈ ℕ -𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
| 16 | 3, 15 | mpd 16 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 17 | arch 12596 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℕ 𝐴 < 𝑦) | |
| 18 | nnz 12707 | . . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℤ) | |
| 19 | 18 | anim1i 627 | . . . 4 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 < 𝑦) → (𝑦 ∈ ℤ ∧ 𝐴 < 𝑦)) |
| 20 | 19 | reximi2 3096 | . . 3 ⊢ (∃𝑦 ∈ ℕ 𝐴 < 𝑦 → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
| 21 | 17, 20 | syl 18 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
| 22 | 16, 21 | jca 521 | 1 ⊢ (𝐴 ∈ ℝ → (∃𝑥 ∈ ℤ 𝑥 < 𝐴 ∧ ∃𝑦 ∈ ℤ 𝐴 < 𝑦)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ∃wrex 3087 class class class wbr 5103 ℝcr 11192 < clt 11336 -cneg 11535 ℕcn 12328 ℤcz 12686 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-z 12687 |
| This theorem is used by: lbzbi 13056 rpnnen1lem2 13098 rpnnen1lem1 13099 rpnnen1lem3 13100 rpnnen1lem5 13102 fourierdlem64 47149 |
| Copyright terms: Public domain | W3C validator |