| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fprod1p | Structured version Visualization version GIF version | ||
| Description: Separate out the first term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.) |
| Ref | Expression |
|---|---|
| fprod1p.1 | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| fprod1p.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
| fprod1p.3 | ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| fprod1p | ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fprod1p.1 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 2 | eluzfz1 13703 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
| 3 | 1, 2 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
| 4 | 3 | elfzelzd 13696 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | fzsn 13739 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀}) |
| 7 | 6 | ineq1d 4118 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁))) |
| 8 | 4 | zred 12842 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 9 | 8 | ltp1d 12286 | . . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1)) |
| 10 | fzdisj 13724 | . . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 12 | 7, 11 | eqtr3d 2803 | . . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 13 | fzsplit 13723 | . . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) | |
| 14 | 3, 13 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) |
| 15 | 6 | uneq1d 4168 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 16 | 14, 15 | eqtrd 2801 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 17 | fzfid 14155 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin) | |
| 18 | fprod1p.2 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 19 | 12, 16, 17, 18 | fprodsplit 16176 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 20 | fprod1p.3 | . . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) | |
| 21 | 20 | eleq1d 2852 | . . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ)) |
| 22 | 18 | ralrimiva 3161 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ) |
| 23 | 21, 22, 3 | rspcdva 3580 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 24 | 20 | prodsn 16172 | . . . 4 ⊢ ((𝑀 ∈ (𝑀...𝑁) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 25 | 3, 23, 24 | syl2anc 596 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 26 | 25 | oveq1d 7465 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 27 | 19, 26 | eqtrd 2801 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∩ cin 4091 ∪ cun 4151 ∅c0 4280 {csn 4587 class class class wbr 5107 ‘cfv 6565 (class class class)co 7450 ℂcc 11236 1c1 11239 + caddc 11241 · cmul 11243 < clt 11381 ℤcz 12732 ℤ≥cuz 13004 ...cfz 13678 ∏cprod 16115 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-inf2 9678 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-pre-sup 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-se 5611 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-isom 6574 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-sup 9470 df-oi 9540 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-z 12733 df-uz 13005 df-rp 13160 df-fz 13679 df-fzo 13828 df-seq 14184 df-exp 14244 df-hash 14515 df-cj 15308 df-re 15309 df-im 15310 df-sqrt 15444 df-abs 15445 df-clim 15698 df-prod 16116 |
| This theorem is used by: fallfacfwd 16245 0fallfac 16246 etransclem4 47581 etransclem31 47608 etransclem35 47612 |
| Copyright terms: Public domain | W3C validator |