![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > btwnz | 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 7741 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
2 | arch 8668 | . . . 4 ⊢ (-𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) | |
3 | 1, 2 | syl 14 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) |
4 | nnre 8427 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ) | |
5 | ltnegcon1 7939 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴)) | |
6 | 5 | ex 113 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℝ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
7 | 4, 6 | syl5 32 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
8 | 7 | pm5.32d 438 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) ↔ (𝑧 ∈ ℕ ∧ -𝑧 < 𝐴))) |
9 | nnnegz 8751 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ → -𝑧 ∈ ℤ) | |
10 | breq1 3848 | . . . . . . . 8 ⊢ (𝑥 = -𝑧 → (𝑥 < 𝐴 ↔ -𝑧 < 𝐴)) | |
11 | 10 | rspcev 2722 | . . . . . . 7 ⊢ ((-𝑧 ∈ ℤ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
12 | 9, 11 | sylan 277 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
13 | 8, 12 | syl6bi 161 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
14 | 13 | expd 254 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴))) |
15 | 14 | rexlimdv 2488 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃𝑧 ∈ ℕ -𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
16 | 3, 15 | mpd 13 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
17 | arch 8668 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℕ 𝐴 < 𝑦) | |
18 | nnz 8767 | . . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℤ) | |
19 | 18 | anim1i 333 | . . . 4 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 < 𝑦) → (𝑦 ∈ ℤ ∧ 𝐴 < 𝑦)) |
20 | 19 | reximi2 2469 | . . 3 ⊢ (∃𝑦 ∈ ℕ 𝐴 < 𝑦 → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
21 | 17, 20 | syl 14 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
22 | 16, 21 | jca 300 | 1 ⊢ (𝐴 ∈ ℝ → (∃𝑥 ∈ ℤ 𝑥 < 𝐴 ∧ ∃𝑦 ∈ ℤ 𝐴 < 𝑦)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∈ wcel 1438 ∃wrex 2360 class class class wbr 3845 ℝcr 7347 < clt 7520 -cneg 7652 ℕcn 8420 ℤcz 8748 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-13 1449 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-sep 3957 ax-pow 4009 ax-pr 4036 ax-un 4260 ax-setind 4353 ax-cnex 7434 ax-resscn 7435 ax-1cn 7436 ax-1re 7437 ax-icn 7438 ax-addcl 7439 ax-addrcl 7440 ax-mulcl 7441 ax-addcom 7443 ax-addass 7445 ax-distr 7447 ax-i2m1 7448 ax-0lt1 7449 ax-0id 7451 ax-rnegex 7452 ax-cnre 7454 ax-pre-ltirr 7455 ax-pre-ltwlin 7456 ax-pre-lttrn 7457 ax-pre-ltadd 7459 ax-arch 7462 |
This theorem depends on definitions: df-bi 115 df-3or 925 df-3an 926 df-tru 1292 df-fal 1295 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ne 2256 df-nel 2351 df-ral 2364 df-rex 2365 df-reu 2366 df-rab 2368 df-v 2621 df-sbc 2841 df-dif 3001 df-un 3003 df-in 3005 df-ss 3012 df-pw 3431 df-sn 3452 df-pr 3453 df-op 3455 df-uni 3654 df-int 3689 df-br 3846 df-opab 3900 df-id 4120 df-xp 4444 df-rel 4445 df-cnv 4446 df-co 4447 df-dm 4448 df-iota 4980 df-fun 5017 df-fv 5023 df-riota 5608 df-ov 5655 df-oprab 5656 df-mpt2 5657 df-pnf 7522 df-mnf 7523 df-xr 7524 df-ltxr 7525 df-le 7526 df-sub 7653 df-neg 7654 df-inn 8421 df-z 8749 |
This theorem is referenced by: lbzbi 9099 exbtwnzlemex 9657 rebtwn2z 9662 |
Copyright terms: Public domain | W3C validator |