| 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 9803 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ∈ ℤ) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐴 ∈ ℤ) |
| 3 | eluzelz 9808 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
| 4 | nn0z 9542 | . . . 4 ⊢ (𝐶 ∈ ℕ0 → 𝐶 ∈ ℤ) | |
| 5 | zaddcl 9562 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐵 + 𝐶) ∈ ℤ) | |
| 6 | 3, 4, 5 | syl2an 289 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → (𝐵 + 𝐶) ∈ ℤ) |
| 7 | 3 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐵 ∈ ℤ) |
| 8 | eluzle 9811 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐴 ≤ 𝐵) | |
| 9 | 8 | adantr 276 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐴 ≤ 𝐵) |
| 10 | nn0ge0 9470 | . . . . 5 ⊢ (𝐶 ∈ ℕ0 → 0 ≤ 𝐶) | |
| 11 | 10 | adantl 277 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 0 ≤ 𝐶) |
| 12 | eluzelre 9809 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℝ) | |
| 13 | nn0re 9454 | . . . . 5 ⊢ (𝐶 ∈ ℕ0 → 𝐶 ∈ ℝ) | |
| 14 | addge01 8695 | . . . . 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 10294 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘𝐴) ∧ 𝐶 ∈ ℕ0) → 𝐵 ∈ (𝐴...(𝐵 + 𝐶))) |
| 18 | fzosplit 10457 | . 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 2202 ∪ cun 3199 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ℝcr 8074 0cc0 8075 + caddc 8078 ≤ cle 8258 ℕ0cn0 9445 ℤcz 9522 ℤ≥cuz 9798 ...cfz 10286 ..^cfzo 10420 |
| 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-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| 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-csb 3129 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-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-inn 9187 df-n0 9446 df-z 9523 df-uz 9799 df-fz 10287 df-fzo 10421 |
| This theorem is referenced by: clwwlkccatlem 16321 |
| Copyright terms: Public domain | W3C validator |