| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > btwnnz | Structured version Visualization version 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 12739 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ (𝐴 + 1) ≤ 𝐵)) | |
| 2 | peano2z 12730 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℤ) | |
| 3 | zre 12690 | . . . . . . . 8 ⊢ ((𝐴 + 1) ∈ ℤ → (𝐴 + 1) ∈ ℝ) | |
| 4 | 2, 3 | syl 18 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℝ) |
| 5 | zre 12690 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 6 | lenlt 11381 | . . . . . . 7 ⊢ (((𝐴 + 1) ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) | |
| 7 | 4, 5, 6 | syl2an 608 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 8 | 1, 7 | bitrd 282 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 9 | 8 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → ¬ 𝐵 < (𝐴 + 1))) |
| 10 | 9 | impancom 457 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 ∈ ℤ → ¬ 𝐵 < (𝐴 + 1))) |
| 11 | 10 | con2d 135 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 < (𝐴 + 1) → ¬ 𝐵 ∈ ℤ)) |
| 12 | 11 | 3impia 1135 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵 ∧ 𝐵 < (𝐴 + 1)) → ¬ 𝐵 ∈ ℤ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2145 class class class wbr 5103 (class class class)co 7418 ℝcr 11192 1c1 11194 + caddc 11196 < clt 11336 ≤ cle 11337 ℤ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 |
| 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-n0 12600 df-z 12687 |
| This theorem is used by: gtndiv 12769 3halfnz 12771 nn01to3 13061 seqcoll 14602 eirrlem 16365 nonsq 16928 zcld 25126 cos02pilt1 26847 cosne0 26850 sumnnodd 46611 sinaover2ne0 46847 dirkertrigeqlem3 47079 dirkercncflem1 47082 dirkercncflem2 47083 dirkercncflem4 47085 fourierdlem20 47106 fourierdlem24 47110 fourierdlem46 47131 fourierdlem63 47148 fourierdlem64 47149 fourierdlem65 47150 |
| Copyright terms: Public domain | W3C validator |