| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzostep1 | GIF version | ||
| Description: Two possibilities for a number one greater than a number in a half-open range. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| fzostep1 | ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzoel1 10379 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ∈ ℤ) | |
| 2 | uzid 9769 | . . . 4 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ (ℤ≥‘𝐵)) | |
| 3 | peano2uz 9816 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐵) → (𝐵 + 1) ∈ (ℤ≥‘𝐵)) | |
| 4 | fzoss1 10407 | . . . 4 ⊢ ((𝐵 + 1) ∈ (ℤ≥‘𝐵) → ((𝐵 + 1)..^(𝐶 + 1)) ⊆ (𝐵..^(𝐶 + 1))) | |
| 5 | 1, 2, 3, 4 | 4syl 18 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐵 + 1)..^(𝐶 + 1)) ⊆ (𝐵..^(𝐶 + 1))) |
| 6 | 1z 9504 | . . . 4 ⊢ 1 ∈ ℤ | |
| 7 | fzoaddel 10431 | . . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 1 ∈ ℤ) → (𝐴 + 1) ∈ ((𝐵 + 1)..^(𝐶 + 1))) | |
| 8 | 6, 7 | mpan2 425 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐴 + 1) ∈ ((𝐵 + 1)..^(𝐶 + 1))) |
| 9 | 5, 8 | sseldd 3228 | . 2 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐴 + 1) ∈ (𝐵..^(𝐶 + 1))) |
| 10 | elfzoel2 10380 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐶 ∈ ℤ) | |
| 11 | elfzolt3 10392 | . . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 < 𝐶) | |
| 12 | zre 9482 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 13 | zre 9482 | . . . . . . 7 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℝ) | |
| 14 | ltle 8266 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) | |
| 15 | 12, 13, 14 | syl2an 289 | . . . . . 6 ⊢ ((𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) |
| 16 | 1, 10, 15 | syl2anc 411 | . . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) |
| 17 | 11, 16 | mpd 13 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ≤ 𝐶) |
| 18 | eluz2 9760 | . . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) ↔ (𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐵 ≤ 𝐶)) | |
| 19 | 1, 10, 17, 18 | syl3anbrc 1207 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐶 ∈ (ℤ≥‘𝐵)) |
| 20 | fzosplitsni 10480 | . . 3 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) → ((𝐴 + 1) ∈ (𝐵..^(𝐶 + 1)) ↔ ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶))) | |
| 21 | 19, 20 | syl 14 | . 2 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^(𝐶 + 1)) ↔ ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶))) |
| 22 | 9, 21 | mpbid 147 | 1 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∨ wo 715 = wceq 1397 ∈ wcel 2202 ⊆ wss 3200 class class class wbr 4088 ‘cfv 5326 (class class class)co 6017 ℝcr 8030 1c1 8032 + caddc 8034 < clt 8213 ≤ cle 8214 ℤcz 9478 ℤ≥cuz 9754 ..^cfzo 10376 |
| 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 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 |
| 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-csb 3128 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-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-n0 9402 df-z 9479 df-uz 9755 df-fz 10243 df-fzo 10377 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |