| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > btwnapz | GIF version | ||
| Description: A number between an integer and its successor is apart from any integer. (Contributed by Jim Kingdon, 6-Jan-2023.) |
| Ref | Expression |
|---|---|
| btwnapz.a | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| btwnapz.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| btwnapz.c | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| btwnapz.ab | ⊢ (𝜑 → 𝐴 < 𝐵) |
| btwnapz.ba | ⊢ (𝜑 → 𝐵 < (𝐴 + 1)) |
| Ref | Expression |
|---|---|
| btwnapz | ⊢ (𝜑 → 𝐵 # 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | btwnapz.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 2 | 1 | zred 9602 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 3 | 2 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐶 ∈ ℝ) |
| 4 | btwnapz.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 5 | 4 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐵 ∈ ℝ) |
| 6 | btwnapz.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 7 | 6 | zred 9602 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 8 | 7 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐴 ∈ ℝ) |
| 9 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐶 ≤ 𝐴) | |
| 10 | btwnapz.ab | . . . . 5 ⊢ (𝜑 → 𝐴 < 𝐵) | |
| 11 | 10 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐴 < 𝐵) |
| 12 | 3, 8, 5, 9, 11 | lelttrd 8304 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐶 < 𝐵) |
| 13 | 3, 5, 12 | gtapd 8817 | . 2 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐵 # 𝐶) |
| 14 | 4 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 ∈ ℝ) |
| 15 | 2 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐶 ∈ ℝ) |
| 16 | peano2re 8315 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) ∈ ℝ) | |
| 17 | 7, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ) |
| 18 | 17 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → (𝐴 + 1) ∈ ℝ) |
| 19 | btwnapz.ba | . . . . 5 ⊢ (𝜑 → 𝐵 < (𝐴 + 1)) | |
| 20 | 19 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 < (𝐴 + 1)) |
| 21 | zltp1le 9534 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) | |
| 22 | 6, 1, 21 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) |
| 23 | 22 | biimpa 296 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → (𝐴 + 1) ≤ 𝐶) |
| 24 | 14, 18, 15, 20, 23 | ltletrd 8603 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 < 𝐶) |
| 25 | 14, 15, 24 | ltapd 8818 | . 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 # 𝐶) |
| 26 | zlelttric 9524 | . . 3 ⊢ ((𝐶 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐶 ≤ 𝐴 ∨ 𝐴 < 𝐶)) | |
| 27 | 1, 6, 26 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐶 ≤ 𝐴 ∨ 𝐴 < 𝐶)) |
| 28 | 13, 25, 27 | mpjaodan 805 | 1 ⊢ (𝜑 → 𝐵 # 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6018 ℝcr 8031 1c1 8033 + caddc 8035 < clt 8214 ≤ cle 8215 # cap 8761 ℤcz 9479 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-inn 9144 df-n0 9403 df-z 9480 |
| This theorem is referenced by: eirraplem 12343 |
| Copyright terms: Public domain | W3C validator |