| 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 13447 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
| 3 | 1, 2 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
| 4 | 3 | elfzelzd 13441 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | fzsn 13482 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 6 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀}) |
| 7 | 6 | ineq1d 4171 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁))) |
| 8 | 4 | zred 12596 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 9 | 8 | ltp1d 12072 | . . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1)) |
| 10 | fzdisj 13467 | . . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) | |
| 11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 12 | 7, 11 | eqtr3d 2773 | . . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 13 | fzsplit 13466 | . . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) | |
| 14 | 3, 13 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) |
| 15 | 6 | uneq1d 4119 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 16 | 14, 15 | eqtrd 2771 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 17 | fzfid 13896 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin) | |
| 18 | fprod1p.2 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 19 | 12, 16, 17, 18 | fprodsplit 15889 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 20 | fprod1p.3 | . . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) | |
| 21 | 20 | eleq1d 2821 | . . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ)) |
| 22 | 18 | ralrimiva 3128 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ) |
| 23 | 21, 22, 3 | rspcdva 3577 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 24 | 20 | prodsn 15885 | . . . 4 ⊢ ((𝑀 ∈ (𝑀...𝑁) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 25 | 3, 23, 24 | syl2anc 584 | . . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 26 | 25 | oveq1d 7373 | . 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 27 | 19, 26 | eqtrd 2771 | 1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∪ cun 3899 ∩ cin 3900 ∅c0 4285 {csn 4580 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 1c1 11027 + caddc 11029 · cmul 11031 < clt 11166 ℤcz 12488 ℤ≥cuz 12751 ...cfz 13423 ∏cprod 15826 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 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 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-oi 9415 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fzo 13571 df-seq 13925 df-exp 13985 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-clim 15411 df-prod 15827 |
| This theorem is referenced by: fallfacfwd 15959 0fallfac 15960 etransclem4 46482 etransclem31 46509 etransclem35 46513 |
| Copyright terms: Public domain | W3C validator |