| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzoun | GIF version | ||
| Description: A half-open integer range as union of two half-open integer ranges. (Contributed by AV, 23-Apr-2022.) |
| Ref | Expression |
|---|---|
| fzoun | ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → (𝐴..^(𝐵 + 𝐶)) = ((𝐴..^𝐵) ∪ (𝐵..^(𝐵 + 𝐶)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzel2 9876 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℤ) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐴 ∈ ℤ) |
| 3 | eluzelz 9881 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
| 4 | nn0z 9614 | . . . 4 ⊢ (𝐶 ∈ ℕ0 → 𝐶 ∈ ℤ) | |
| 5 | zaddcl 9634 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐵 + 𝐶) ∈ ℤ) | |
| 6 | 3, 4, 5 | syl2an 289 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → (𝐵 + 𝐶) ∈ ℤ) |
| 7 | 3 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐵 ∈ ℤ) |
| 8 | eluzle 9884 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ≤ 𝐵) | |
| 9 | 8 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐴 ≤ 𝐵) |
| 10 | nn0ge0 9538 | . . . . 5 ⊢ (𝐶 ∈ ℕ0 → 0 ≤ 𝐶) | |
| 11 | 10 | adantl 277 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 0 ≤ 𝐶) |
| 12 | eluzelre 9882 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℝ) | |
| 13 | nn0re 9522 | . . . . 5 ⊢ (𝐶 ∈ ℕ0 → 𝐶 ∈ ℝ) | |
| 14 | addge01 8763 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (0 ≤ 𝐶 ↔ 𝐵 ≤ (𝐵 + 𝐶))) | |
| 15 | 12, 13, 14 | syl2an 289 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → (0 ≤ 𝐶 ↔ 𝐵 ≤ (𝐵 + 𝐶))) |
| 16 | 11, 15 | mpbid 147 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐵 ≤ (𝐵 + 𝐶)) |
| 17 | 2, 6, 7, 9, 16 | elfzd 10369 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐵 ∈ (𝐴...(𝐵 + 𝐶))) |
| 18 | fzosplit 10535 | . 2 ⊢ (𝐵 ∈ (𝐴...(𝐵 + 𝐶)) → (𝐴..^(𝐵 + 𝐶)) = ((𝐴..^𝐵) ∪ (𝐵..^(𝐵 + 𝐶)))) | |
| 19 | 17, 18 | syl 14 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → (𝐴..^(𝐵 + 𝐶)) = ((𝐴..^𝐵) ∪ (𝐵..^(𝐵 + 𝐶)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∪ cun 3212 class class class wbr 4114 ‘cfv 5357 (class class class)co 6058 ℝcr 8142 0cc0 8143 + caddc 8146 ≤ cle 8325 ℕ0cn0 9513 ℤcz 9594 ℤ≥cuz 9871 ...cfz 10361 ..^cfzo 10498 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| 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 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-fz 10362 df-fzo 10499 |
| This theorem is referenced by: clwwlkccatlem 16507 |
| Copyright terms: Public domain | W3C validator |