| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzoaddel2 | GIF version | ||
| Description: Translate membership in a shifted-down half-open integer range. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
| Ref | Expression |
|---|---|
| fzoaddel2 | ⊢ ((𝐴 ∈ (0..^(𝐵 − 𝐶)) ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐴 + 𝐶) ∈ (𝐶..^𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fzoaddel 10438 | . . 3 ⊢ ((𝐴 ∈ (0..^(𝐵 − 𝐶)) ∧ 𝐶 ∈ ℤ) → (𝐴 + 𝐶) ∈ ((0 + 𝐶)..^((𝐵 − 𝐶) + 𝐶))) | |
| 2 | 1 | 3adant2 1042 | . 2 ⊢ ((𝐴 ∈ (0..^(𝐵 − 𝐶)) ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐴 + 𝐶) ∈ ((0 + 𝐶)..^((𝐵 − 𝐶) + 𝐶))) |
| 3 | zcn 9489 | . . . 4 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ) | |
| 4 | zcn 9489 | . . . 4 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℂ) | |
| 5 | addlid 8323 | . . . . . 6 ⊢ (𝐶 ∈ ℂ → (0 + 𝐶) = 𝐶) | |
| 6 | 5 | adantl 277 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (0 + 𝐶) = 𝐶) |
| 7 | npcan 8393 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + 𝐶) = 𝐵) | |
| 8 | 6, 7 | oveq12d 6041 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((0 + 𝐶)..^((𝐵 − 𝐶) + 𝐶)) = (𝐶..^𝐵)) |
| 9 | 3, 4, 8 | syl2an 289 | . . 3 ⊢ ((𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → ((0 + 𝐶)..^((𝐵 − 𝐶) + 𝐶)) = (𝐶..^𝐵)) |
| 10 | 9 | 3adant1 1041 | . 2 ⊢ ((𝐴 ∈ (0..^(𝐵 − 𝐶)) ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → ((0 + 𝐶)..^((𝐵 − 𝐶) + 𝐶)) = (𝐶..^𝐵)) |
| 11 | 2, 10 | eleqtrd 2309 | 1 ⊢ ((𝐴 ∈ (0..^(𝐵 − 𝐶)) ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐴 + 𝐶) ∈ (𝐶..^𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∈ wcel 2201 (class class class)co 6023 ℂcc 8035 0cc0 8037 + caddc 8040 − cmin 8355 ℤcz 9484 ..^cfzo 10382 |
| 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 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-0id 8145 ax-rnegex 8146 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-ltadd 8153 |
| 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 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-inn 9149 df-n0 9408 df-z 9485 df-uz 9761 df-fz 10249 df-fzo 10383 |
| This theorem is referenced by: swrdclg 11240 swrdwrdsymbg 11254 |
| Copyright terms: Public domain | W3C validator |