![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fzoshftral | GIF version |
Description: Shift the scanning order inside of a quantification over a half-open integer range, analogous to fzshftral 10125. (Contributed by Alexander van der Vekens, 23-Sep-2018.) |
Ref | Expression |
---|---|
fzoshftral | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑗 ∈ (𝑀..^𝑁)𝜑 ↔ ∀𝑘 ∈ ((𝑀 + 𝐾)..^(𝑁 + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzoval 10165 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑀..^𝑁) = (𝑀...(𝑁 − 1))) | |
2 | 1 | 3ad2ant2 1020 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑀..^𝑁) = (𝑀...(𝑁 − 1))) |
3 | 2 | raleqdv 2691 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑗 ∈ (𝑀..^𝑁)𝜑 ↔ ∀𝑗 ∈ (𝑀...(𝑁 − 1))𝜑)) |
4 | peano2zm 9308 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
5 | fzshftral 10125 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑗 ∈ (𝑀...(𝑁 − 1))𝜑 ↔ ∀𝑘 ∈ ((𝑀 + 𝐾)...((𝑁 − 1) + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑)) | |
6 | 4, 5 | syl3an2 1282 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑗 ∈ (𝑀...(𝑁 − 1))𝜑 ↔ ∀𝑘 ∈ ((𝑀 + 𝐾)...((𝑁 − 1) + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑)) |
7 | zaddcl 9310 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 + 𝐾) ∈ ℤ) | |
8 | 7 | 3adant1 1016 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 + 𝐾) ∈ ℤ) |
9 | fzoval 10165 | . . . . 5 ⊢ ((𝑁 + 𝐾) ∈ ℤ → ((𝑀 + 𝐾)..^(𝑁 + 𝐾)) = ((𝑀 + 𝐾)...((𝑁 + 𝐾) − 1))) | |
10 | 8, 9 | syl 14 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑀 + 𝐾)..^(𝑁 + 𝐾)) = ((𝑀 + 𝐾)...((𝑁 + 𝐾) − 1))) |
11 | zcn 9275 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
12 | 11 | adantr 276 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → 𝑁 ∈ ℂ) |
13 | zcn 9275 | . . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
14 | 13 | adantl 277 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → 𝐾 ∈ ℂ) |
15 | 1cnd 7990 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → 1 ∈ ℂ) | |
16 | 12, 14, 15 | addsubd 8306 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑁 + 𝐾) − 1) = ((𝑁 − 1) + 𝐾)) |
17 | 16 | 3adant1 1016 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑁 + 𝐾) − 1) = ((𝑁 − 1) + 𝐾)) |
18 | 17 | oveq2d 5906 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑀 + 𝐾)...((𝑁 + 𝐾) − 1)) = ((𝑀 + 𝐾)...((𝑁 − 1) + 𝐾))) |
19 | 10, 18 | eqtr2d 2222 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑀 + 𝐾)...((𝑁 − 1) + 𝐾)) = ((𝑀 + 𝐾)..^(𝑁 + 𝐾))) |
20 | 19 | raleqdv 2691 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑘 ∈ ((𝑀 + 𝐾)...((𝑁 − 1) + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑 ↔ ∀𝑘 ∈ ((𝑀 + 𝐾)..^(𝑁 + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑)) |
21 | 3, 6, 20 | 3bitrd 214 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (∀𝑗 ∈ (𝑀..^𝑁)𝜑 ↔ ∀𝑘 ∈ ((𝑀 + 𝐾)..^(𝑁 + 𝐾))[(𝑘 − 𝐾) / 𝑗]𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 979 = wceq 1363 ∈ wcel 2159 ∀wral 2467 [wsbc 2976 (class class class)co 5890 ℂcc 7826 1c1 7829 + caddc 7831 − cmin 8145 ℤcz 9270 ...cfz 10025 ..^cfzo 10159 |
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 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2161 ax-14 2162 ax-ext 2170 ax-sep 4135 ax-pow 4188 ax-pr 4223 ax-un 4447 ax-setind 4550 ax-cnex 7919 ax-resscn 7920 ax-1cn 7921 ax-1re 7922 ax-icn 7923 ax-addcl 7924 ax-addrcl 7925 ax-mulcl 7926 ax-addcom 7928 ax-addass 7930 ax-distr 7932 ax-i2m1 7933 ax-0lt1 7934 ax-0id 7936 ax-rnegex 7937 ax-cnre 7939 ax-pre-ltirr 7940 ax-pre-ltwlin 7941 ax-pre-lttrn 7942 ax-pre-ltadd 7944 |
This theorem depends on definitions: df-bi 117 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2040 df-mo 2041 df-clab 2175 df-cleq 2181 df-clel 2184 df-nfc 2320 df-ne 2360 df-nel 2455 df-ral 2472 df-rex 2473 df-reu 2474 df-rab 2476 df-v 2753 df-sbc 2977 df-csb 3072 df-dif 3145 df-un 3147 df-in 3149 df-ss 3156 df-pw 3591 df-sn 3612 df-pr 3613 df-op 3615 df-uni 3824 df-int 3859 df-iun 3902 df-br 4018 df-opab 4079 df-mpt 4080 df-id 4307 df-xp 4646 df-rel 4647 df-cnv 4648 df-co 4649 df-dm 4650 df-rn 4651 df-res 4652 df-ima 4653 df-iota 5192 df-fun 5232 df-fn 5233 df-f 5234 df-fv 5238 df-riota 5846 df-ov 5893 df-oprab 5894 df-mpo 5895 df-1st 6158 df-2nd 6159 df-pnf 8011 df-mnf 8012 df-xr 8013 df-ltxr 8014 df-le 8015 df-sub 8147 df-neg 8148 df-inn 8937 df-n0 9194 df-z 9271 df-uz 9546 df-fz 10026 df-fzo 10160 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |