| 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 9645 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 3 | 2 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐶 ∈ ℝ) |
| 4 | btwnapz.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 5 | 4 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐵 ∈ ℝ) |
| 6 | btwnapz.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 7 | 6 | zred 9645 | . . . . 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 8347 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐶 < 𝐵) |
| 13 | 3, 5, 12 | gtapd 8860 | . 2 ⊢ ((𝜑 ∧ 𝐶 ≤ 𝐴) → 𝐵 # 𝐶) |
| 14 | 4 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 ∈ ℝ) |
| 15 | 2 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐶 ∈ ℝ) |
| 16 | peano2re 8358 | . . . . . 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 9577 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) | |
| 22 | 6, 1, 21 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) |
| 23 | 22 | biimpa 296 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → (𝐴 + 1) ≤ 𝐶) |
| 24 | 14, 18, 15, 20, 23 | ltletrd 8646 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 < 𝐶) |
| 25 | 14, 15, 24 | ltapd 8861 | . 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐶) → 𝐵 # 𝐶) |
| 26 | zlelttric 9567 | . . 3 ⊢ ((𝐶 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐶 ≤ 𝐴 ∨ 𝐴 < 𝐶)) | |
| 27 | 1, 6, 26 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐶 ≤ 𝐴 ∨ 𝐴 < 𝐶)) |
| 28 | 13, 25, 27 | mpjaodan 806 | 1 ⊢ (𝜑 → 𝐵 # 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 ℝcr 8074 1c1 8076 + caddc 8078 < clt 8257 ≤ cle 8258 # cap 8804 ℤcz 9522 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-reap 8798 df-ap 8805 df-inn 9187 df-n0 9446 df-z 9523 |
| This theorem is referenced by: eirraplem 12399 |
| Copyright terms: Public domain | W3C validator |