Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > prodsplit | Structured version Visualization version GIF version |
Description: Product split into two factors, original by Steven Nguyen. (Contributed by metakunt, 21-Apr-2024.) |
Ref | Expression |
---|---|
prodsplit.1 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
prodsplit.2 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
prodsplit.3 | ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
prodsplit.4 | ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
prodsplit.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 + 𝐾))) → 𝐴 ∈ ℂ) |
Ref | Expression |
---|---|
prodsplit | ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 𝐾))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · ∏𝑘 ∈ ((𝑁 + 1)...(𝑁 + 𝐾))𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prodsplit.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
2 | 1 | zred 12074 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
3 | 2 | ltp1d 11556 | . . 3 ⊢ (𝜑 → 𝑁 < (𝑁 + 1)) |
4 | fzdisj 12924 | . . 3 ⊢ (𝑁 < (𝑁 + 1) → ((𝑀...𝑁) ∩ ((𝑁 + 1)...(𝑁 + 𝐾))) = ∅) | |
5 | 3, 4 | syl 17 | . 2 ⊢ (𝜑 → ((𝑀...𝑁) ∩ ((𝑁 + 1)...(𝑁 + 𝐾))) = ∅) |
6 | prodsplit.1 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
7 | prodsplit.4 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
8 | 7 | nn0zd 12072 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
9 | 1, 8 | zaddcld 12078 | . . . 4 ⊢ (𝜑 → (𝑁 + 𝐾) ∈ ℤ) |
10 | prodsplit.3 | . . . 4 ⊢ (𝜑 → 𝑀 ≤ 𝑁) | |
11 | nn0addge1 11930 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝐾 ∈ ℕ0) → 𝑁 ≤ (𝑁 + 𝐾)) | |
12 | 2, 7, 11 | syl2anc 586 | . . . 4 ⊢ (𝜑 → 𝑁 ≤ (𝑁 + 𝐾)) |
13 | elfz4 12891 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ (𝑁 + 𝐾) ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 ≤ 𝑁 ∧ 𝑁 ≤ (𝑁 + 𝐾))) → 𝑁 ∈ (𝑀...(𝑁 + 𝐾))) | |
14 | 6, 9, 1, 10, 12, 13 | syl32anc 1374 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (𝑀...(𝑁 + 𝐾))) |
15 | fzsplit 12923 | . . 3 ⊢ (𝑁 ∈ (𝑀...(𝑁 + 𝐾)) → (𝑀...(𝑁 + 𝐾)) = ((𝑀...𝑁) ∪ ((𝑁 + 1)...(𝑁 + 𝐾)))) | |
16 | 14, 15 | syl 17 | . 2 ⊢ (𝜑 → (𝑀...(𝑁 + 𝐾)) = ((𝑀...𝑁) ∪ ((𝑁 + 1)...(𝑁 + 𝐾)))) |
17 | fzfid 13331 | . 2 ⊢ (𝜑 → (𝑀...(𝑁 + 𝐾)) ∈ Fin) | |
18 | prodsplit.5 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 + 𝐾))) → 𝐴 ∈ ℂ) | |
19 | 5, 16, 17, 18 | fprodsplit 15305 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 𝐾))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · ∏𝑘 ∈ ((𝑁 + 1)...(𝑁 + 𝐾))𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∪ cun 3922 ∩ cin 3923 ∅c0 4279 class class class wbr 5052 (class class class)co 7142 ℂcc 10521 ℝcr 10522 1c1 10524 + caddc 10526 · cmul 10528 < clt 10661 ≤ cle 10662 ℕ0cn0 11884 ℤcz 11968 ...cfz 12882 ∏cprod 15244 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-inf2 9090 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 ax-pre-sup 10601 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-int 4863 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-se 5501 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-isom 6350 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-oadd 8092 df-er 8275 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-sup 8892 df-oi 8960 df-card 9354 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-div 11284 df-nn 11625 df-2 11687 df-3 11688 df-n0 11885 df-z 11969 df-uz 12231 df-rp 12377 df-fz 12883 df-fzo 13024 df-seq 13360 df-exp 13420 df-hash 13681 df-cj 14443 df-re 14444 df-im 14445 df-sqrt 14579 df-abs 14580 df-clim 14830 df-prod 15245 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |