| 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 11625 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 2 | arch 12607 | . . . 4 ⊢ ( -𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) |
| 4 | nnre 12346 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ) | |
| 5 | ltnegcon1 11821 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑧 ∈ ℝ) → ( -𝐴 < 𝑧 ↔ -𝑧 < 𝐴)) | |
| 6 | 5 | ex 418 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℝ → ( -𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
| 7 | 4, 6 | syl5 35 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → ( -𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
| 8 | 7 | pm5.32d 588 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) ↔ (𝑧 ∈ ℕ ∧ -𝑧 < 𝐴))) |
| 9 | nnnegz 12700 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ → -𝑧 ∈ ℤ) | |
| 10 | breq1 5105 | . . . . . . . 8 ⊢ (𝑥 = -𝑧 → (𝑥 < 𝐴 ↔ -𝑧 < 𝐴)) | |
| 11 | 10 | rspcev 3576 | . . . . . . 7 ⊢ (( -𝑧 ∈ ℤ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 12 | 9, 11 | sylan 592 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 13 | 8, 12 | biimtrdi 256 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
| 14 | 13 | expd 421 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → ( -𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴))) |
| 15 | 14 | rexlimdv 3161 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃𝑧 ∈ ℕ -𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
| 16 | 3, 15 | mpd 16 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
| 17 | arch 12607 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℕ 𝐴 < 𝑦) | |
| 18 | nnz 12718 | . . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℤ) | |
| 19 | 18 | anim1i 627 | . . . 4 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 < 𝑦) → (𝑦 ∈ ℤ ∧ 𝐴 < 𝑦)) |
| 20 | 19 | reximi2 3095 | . . 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 2144 ∃wrex 3086 class class class wbr 5102 ℝcr 11203 < clt 11347 -cneg 11546 ℕcn 12339 ℤcz 12697 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-z 12698 |
| This theorem is used by: lbzbi 13067 rpnnen1lem2 13109 rpnnen1lem1 13110 rpnnen1lem3 13111 rpnnen1lem5 13113 fourierdlem64 47274 |
| Copyright terms: Public domain | W3C validator |