| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzosplitsnm1 | GIF version | ||
| Description: Removing a singleton from a half-open integer range at the end. (Contributed by Alexander van der Vekens, 23-Mar-2018.) |
| Ref | Expression |
|---|---|
| fzosplitsnm1 | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐴..^𝐵) = ((𝐴..^(𝐵 − 1)) ∪ {(𝐵 − 1)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzelz 9947 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘(𝐴 + 1)) → 𝐵 ∈ ℤ) | |
| 2 | 1 | zcnd 9780 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘(𝐴 + 1)) → 𝐵 ∈ ℂ) |
| 3 | 2 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → 𝐵 ∈ ℂ) |
| 4 | ax-1cn 8278 | . . . 4 ⊢ 1 ∈ ℂ | |
| 5 | npcan 8542 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐵 − 1) + 1) = 𝐵) | |
| 6 | 5 | eqcomd 2244 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 1 ∈ ℂ) → 𝐵 = ((𝐵 − 1) + 1)) |
| 7 | 3, 4, 6 | sylancl 417 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → 𝐵 = ((𝐵 − 1) + 1)) |
| 8 | 7 | oveq2d 6104 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐴..^𝐵) = (𝐴..^((𝐵 − 1) + 1))) |
| 9 | eluzp1m1 9962 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐵 − 1) ∈ (ℤ≥‘𝐴)) | |
| 10 | 1 | adantl 277 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → 𝐵 ∈ ℤ) |
| 11 | peano2zm 9693 | . . . . 5 ⊢ (𝐵 ∈ ℤ → (𝐵 − 1) ∈ ℤ) | |
| 12 | uzid 9952 | . . . . 5 ⊢ ((𝐵 − 1) ∈ ℤ → (𝐵 − 1) ∈ (ℤ≥‘(𝐵 − 1))) | |
| 13 | peano2uz 9999 | . . . . 5 ⊢ ((𝐵 − 1) ∈ (ℤ≥‘(𝐵 − 1)) → ((𝐵 − 1) + 1) ∈ (ℤ≥‘(𝐵 − 1))) | |
| 14 | 10, 11, 12, 13 | 4syl 18 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → ((𝐵 − 1) + 1) ∈ (ℤ≥‘(𝐵 − 1))) |
| 15 | elfzuzb 10439 | . . . 4 ⊢ ((𝐵 − 1) ∈ (𝐴...((𝐵 − 1) + 1)) ↔ ((𝐵 − 1) ∈ (ℤ≥‘𝐴) ∧ ((𝐵 − 1) + 1) ∈ (ℤ≥‘(𝐵 − 1)))) | |
| 16 | 9, 14, 15 | sylanbrc 421 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐵 − 1) ∈ (𝐴...((𝐵 − 1) + 1))) |
| 17 | fzosplit 10603 | . . 3 ⊢ ((𝐵 − 1) ∈ (𝐴...((𝐵 − 1) + 1)) → (𝐴..^((𝐵 − 1) + 1)) = ((𝐴..^(𝐵 − 1)) ∪ ((𝐵 − 1)..^((𝐵 − 1) + 1)))) | |
| 18 | 16, 17 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐴..^((𝐵 − 1) + 1)) = ((𝐴..^(𝐵 − 1)) ∪ ((𝐵 − 1)..^((𝐵 − 1) + 1)))) |
| 19 | 1, 11 | syl 14 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘(𝐴 + 1)) → (𝐵 − 1) ∈ ℤ) |
| 20 | 19 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐵 − 1) ∈ ℤ) |
| 21 | fzosn 10640 | . . . 4 ⊢ ((𝐵 − 1) ∈ ℤ → ((𝐵 − 1)..^((𝐵 − 1) + 1)) = {(𝐵 − 1)}) | |
| 22 | 20, 21 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → ((𝐵 − 1)..^((𝐵 − 1) + 1)) = {(𝐵 − 1)}) |
| 23 | 22 | uneq2d 3383 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → ((𝐴..^(𝐵 − 1)) ∪ ((𝐵 − 1)..^((𝐵 − 1) + 1))) = ((𝐴..^(𝐵 − 1)) ∪ {(𝐵 − 1)})) |
| 24 | 8, 18, 23 | 3eqtrd 2275 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ (ℤ≥‘(𝐴 + 1))) → (𝐴..^𝐵) = ((𝐴..^(𝐵 − 1)) ∪ {(𝐵 − 1)})) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 {csn 3709 ‘cfv 5380 (class class class)co 6088 ℂcc 8183 1c1 8186 + caddc 8188 − cmin 8504 ℤcz 9655 ℤ≥cuz 9937 ...cfz 10428 ..^cfzo 10566 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 df-fz 10429 df-fzo 10567 |
| This theorem is used by: elfzonlteqm1 10645 clwwlkccatlem 16846 |
| Copyright terms: Public domain | W3C validator |