| 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 13538 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
| 3 | 1, 2 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
| 4 | 3 | elfzelzd 13532 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | fzsn 13573 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 6 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀}) |
| 7 | 6 | ineq1d 4173 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁))) |
| 8 | 4 | zred 12679 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 9 | 8 | ltp1d 12124 | . . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1)) |
| 10 | fzdisj 13558 | . . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) | |
| 11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 12 | 7, 11 | eqtr3d 2801 | . . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 13 | fzsplit 13557 | . . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) | |
| 14 | 3, 13 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) |
| 15 | 6 | uneq1d 4122 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 16 | 14, 15 | eqtrd 2799 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 17 | fzfid 13988 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin) | |
| 18 | fprod1p.2 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 19 | 12, 16, 17, 18 | fprodsplit 15998 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 20 | fprod1p.3 | . . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) | |
| 21 | 20 | eleq1d 2849 | . . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ)) |
| 22 | 18 | ralrimiva 3156 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ) |
| 23 | 21, 22, 3 | rspcdva 3584 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 24 | 20 | prodsn 15994 | . . . 4 ⊢ ((𝑀 ∈ (𝑀...𝑁) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 25 | 3, 23, 24 | syl2anc 593 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 26 | 25 | oveq1d 7413 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 27 | 19, 26 | eqtrd 2799 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ∪ cun 3904 ∩ cin 3905 ∅c0 4287 {csn 4584 class class class wbr 5102 ‘cfv 6523 (class class class)co 7398 ℂcc 11073 1c1 11076 + caddc 11078 · cmul 11080 < clt 11218 ℤcz 12570 ℤ≥cuz 12841 ...cfz 13514 ∏cprod 15935 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-inf2 9598 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-se 5603 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-isom 6532 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-1o 8439 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-sup 9390 df-oi 9460 df-card 9899 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-div 11847 df-nn 12213 df-2 12282 df-3 12283 df-n0 12484 df-z 12571 df-uz 12842 df-rp 12996 df-fz 13515 df-fzo 13662 df-seq 14017 df-exp 14077 df-hash 14346 df-cj 15128 df-re 15129 df-im 15130 df-sqrt 15264 df-abs 15265 df-clim 15517 df-prod 15936 |
| This theorem is referenced by: fallfacfwd 16068 0fallfac 16069 etransclem4 46817 etransclem31 46844 etransclem35 46848 |
| Copyright terms: Public domain | W3C validator |