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 8023 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
2 | arch 8974 | . . . 4 ⊢ (-𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) | |
3 | 1, 2 | syl 14 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ ℕ -𝐴 < 𝑧) |
4 | nnre 8727 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ) | |
5 | ltnegcon1 8225 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴)) | |
6 | 5 | ex 114 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℝ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
7 | 4, 6 | syl5 32 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 ↔ -𝑧 < 𝐴))) |
8 | 7 | pm5.32d 445 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) ↔ (𝑧 ∈ ℕ ∧ -𝑧 < 𝐴))) |
9 | nnnegz 9057 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ → -𝑧 ∈ ℤ) | |
10 | breq1 3932 | . . . . . . . 8 ⊢ (𝑥 = -𝑧 → (𝑥 < 𝐴 ↔ -𝑧 < 𝐴)) | |
11 | 10 | rspcev 2789 | . . . . . . 7 ⊢ ((-𝑧 ∈ ℤ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
12 | 9, 11 | sylan 281 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ ∧ -𝑧 < 𝐴) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
13 | 8, 12 | syl6bi 162 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((𝑧 ∈ ℕ ∧ -𝐴 < 𝑧) → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
14 | 13 | expd 256 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝑧 ∈ ℕ → (-𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴))) |
15 | 14 | rexlimdv 2548 | . . 3 ⊢ (𝐴 ∈ ℝ → (∃𝑧 ∈ ℕ -𝐴 < 𝑧 → ∃𝑥 ∈ ℤ 𝑥 < 𝐴)) |
16 | 3, 15 | mpd 13 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ ℤ 𝑥 < 𝐴) |
17 | arch 8974 | . . 3 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℕ 𝐴 < 𝑦) | |
18 | nnz 9073 | . . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℤ) | |
19 | 18 | anim1i 338 | . . . 4 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 < 𝑦) → (𝑦 ∈ ℤ ∧ 𝐴 < 𝑦)) |
20 | 19 | reximi2 2528 | . . 3 ⊢ (∃𝑦 ∈ ℕ 𝐴 < 𝑦 → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
21 | 17, 20 | syl 14 | . 2 ⊢ (𝐴 ∈ ℝ → ∃𝑦 ∈ ℤ 𝐴 < 𝑦) |
22 | 16, 21 | jca 304 | 1 ⊢ (𝐴 ∈ ℝ → (∃𝑥 ∈ ℤ 𝑥 < 𝐴 ∧ ∃𝑦 ∈ ℤ 𝐴 < 𝑦)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 ∃wrex 2417 class class class wbr 3929 ℝcr 7619 < clt 7800 -cneg 7934 ℕcn 8720 ℤcz 9054 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 ax-arch 7739 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-z 9055 |
This theorem is referenced by: lbzbi 9408 exbtwnzlemex 10027 rebtwn2z 10032 |
Copyright terms: Public domain | W3C validator |