| 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 12640 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ (𝐴 + 1) ≤ 𝐵)) | |
| 2 | peano2z 12631 | . . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℤ) | |
| 3 | zre 12591 | . . . . . . . 8 ⊢ ((𝐴 + 1) ∈ ℤ → (𝐴 + 1) ∈ ℝ) | |
| 4 | 2, 3 | syl 18 | . . . . . . 7 ⊢ (𝐴 ∈ ℤ → (𝐴 + 1) ∈ ℝ) |
| 5 | zre 12591 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 6 | lenlt 11284 | . . . . . . 7 ⊢ (((𝐴 + 1) ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) | |
| 7 | 4, 5, 6 | syl2an 607 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 + 1) ≤ 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 8 | 1, 7 | bitrd 282 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 < (𝐴 + 1))) |
| 9 | 8 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 → ¬ 𝐵 < (𝐴 + 1))) |
| 10 | 9 | impancom 456 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 ∈ ℤ → ¬ 𝐵 < (𝐴 + 1))) |
| 11 | 10 | con2d 135 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵) → (𝐵 < (𝐴 + 1) → ¬ 𝐵 ∈ ℤ)) |
| 12 | 11 | 3impia 1133 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 < 𝐵 ∧ 𝐵 < (𝐴 + 1)) → ¬ 𝐵 ∈ ℤ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 class class class wbr 5110 (class class class)co 7408 ℝcr 11095 1c1 11097 + caddc 11099 < clt 11239 ≤ cle 11240 ℤcz 12587 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-n0 12501 df-z 12588 |
| This theorem is referenced by: gtndiv 12669 3halfnz 12671 nn01to3 12961 seqcoll 14497 eirrlem 16256 nonsq 16814 zcld 24936 cos02pilt1 26653 cosne0 26656 sumnnodd 46231 sinaover2ne0 46467 dirkertrigeqlem3 46699 dirkercncflem1 46702 dirkercncflem2 46703 dirkercncflem4 46705 fourierdlem20 46726 fourierdlem24 46730 fourierdlem46 46751 fourierdlem63 46768 fourierdlem64 46769 fourierdlem65 46770 |
| Copyright terms: Public domain | W3C validator |