| 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 13449 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
| 3 | 1, 2 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
| 4 | 3 | elfzelzd 13443 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | fzsn 13484 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 6 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀}) |
| 7 | 6 | ineq1d 4170 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁))) |
| 8 | 4 | zred 12598 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 9 | 8 | ltp1d 12074 | . . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1)) |
| 10 | fzdisj 13469 | . . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) | |
| 11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 12 | 7, 11 | eqtr3d 2772 | . . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 13 | fzsplit 13468 | . . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) | |
| 14 | 3, 13 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) |
| 15 | 6 | uneq1d 4118 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 16 | 14, 15 | eqtrd 2770 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 17 | fzfid 13898 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin) | |
| 18 | fprod1p.2 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 19 | 12, 16, 17, 18 | fprodsplit 15891 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 20 | fprod1p.3 | . . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) | |
| 21 | 20 | eleq1d 2820 | . . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ)) |
| 22 | 18 | ralrimiva 3127 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ) |
| 23 | 21, 22, 3 | rspcdva 3576 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 24 | 20 | prodsn 15887 | . . . 4 ⊢ ((𝑀 ∈ (𝑀...𝑁) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 25 | 3, 23, 24 | syl2anc 585 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 26 | 25 | oveq1d 7373 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 27 | 19, 26 | eqtrd 2770 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∪ cun 3898 ∩ cin 3899 ∅c0 4284 {csn 4579 class class class wbr 5097 ‘cfv 6491 (class class class)co 7358 ℂcc 11026 1c1 11029 + caddc 11031 · cmul 11033 < clt 11168 ℤcz 12490 ℤ≥cuz 12753 ...cfz 13425 ∏cprod 15828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-inf2 9552 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-isom 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-sup 9347 df-oi 9417 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-fz 13426 df-fzo 13573 df-seq 13927 df-exp 13987 df-hash 14256 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-clim 15413 df-prod 15829 |
| This theorem is referenced by: fallfacfwd 15961 0fallfac 15962 etransclem4 46519 etransclem31 46546 etransclem35 46550 |
| Copyright terms: Public domain | W3C validator |