| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > btwnnz | GIF version | ||
| Description: A number between an integer and its successor is not an integer. (Contributed by NM, 3-May-2005.) |
| Ref | Expression |
|---|---|
| btwnnz | ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵 ∧ 𝐵 < (𝐴 + 1)) → ¬ 𝐵 ∈ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zltp1le 9522 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ (𝐴 + 1) ≤ 𝐵)) | |
| 2 | peano2z 9503 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℤ) | |
| 3 | zre 9471 | . . . . . . . 8 ⊢ ((𝐴 + 1) ∈ ℤ → (𝐴 + 1) ∈ ℝ) | |
| 4 | 2, 3 | syl 14 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℝ) |
| 5 | zre 9471 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 6 | lenlt 8243 | . . . . . . 7 ⊢ (((𝐴 + 1) ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) | |
| 7 | 4, 5, 6 | syl2an 289 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 8 | 1, 7 | bitrd 188 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 9 | 8 | biimpd 144 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → ¬ 𝐵 < (𝐴 + 1))) |
| 10 | 9 | impancom 260 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 ∈ ℤ → ¬ 𝐵 < (𝐴 + 1))) |
| 11 | 10 | con2d 627 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 < (𝐴 + 1) → ¬ 𝐵 ∈ ℤ)) |
| 12 | 11 | 3impia 1224 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵 ∧ 𝐵 < (𝐴 + 1)) → ¬ 𝐵 ∈ ℤ) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 ∈ wcel 2200 class class class wbr 4084 (class class class)co 6011 ℝcr 8019 1c1 8021 + caddc 8023 < clt 8202 ≤ cle 8203 ℤcz 9467 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4203 ax-pow 4260 ax-pr 4295 ax-un 4526 ax-setind 4631 ax-cnex 8111 ax-resscn 8112 ax-1cn 8113 ax-1re 8114 ax-icn 8115 ax-addcl 8116 ax-addrcl 8117 ax-mulcl 8118 ax-addcom 8120 ax-addass 8122 ax-distr 8124 ax-i2m1 8125 ax-0lt1 8126 ax-0id 8128 ax-rnegex 8129 ax-cnre 8131 ax-pre-ltirr 8132 ax-pre-ltwlin 8133 ax-pre-lttrn 8134 ax-pre-ltadd 8136 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3890 df-int 3925 df-br 4085 df-opab 4147 df-id 4386 df-xp 4727 df-rel 4728 df-cnv 4729 df-co 4730 df-dm 4731 df-iota 5282 df-fun 5324 df-fv 5330 df-riota 5964 df-ov 6014 df-oprab 6015 df-mpo 6016 df-pnf 8204 df-mnf 8205 df-xr 8206 df-ltxr 8207 df-le 8208 df-sub 8340 df-neg 8341 df-inn 9132 df-n0 9391 df-z 9468 |
| This theorem is referenced by: gtndiv 9563 3halfnz 9565 seq3coll 11093 nonsq 12766 |
| Copyright terms: Public domain | W3C validator |