| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iprodn0 | Structured version Visualization version GIF version | ||
| Description: Nonzero series product with an upper integer index set (i.e. an infinite product.) (Contributed by Scott Fenton, 6-Dec-2017.) |
| Ref | Expression |
|---|---|
| zprodn0.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| zprodn0.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| zprodn0.3 | ⊢ (𝜑 → 𝑋 ≠ 0) |
| zprodn0.4 | ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) |
| iprodn0.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
| iprodn0.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
| Ref | Expression |
|---|---|
| iprodn0 | ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 𝐵 = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zprodn0.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | zprodn0.2 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 3 | zprodn0.3 | . 2 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 4 | zprodn0.4 | . 2 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
| 5 | ssidd 3946 | . 2 ⊢ (𝜑 → 𝑍 ⊆ 𝑍) | |
| 6 | iprodn0.5 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
| 7 | iftrue 4473 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → if(𝑘 ∈ 𝑍, 𝐵, 1) = 𝐵) | |
| 8 | 7 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝑍, 𝐵, 1) = 𝐵) |
| 9 | 6, 8 | eqtr4d 2775 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = if(𝑘 ∈ 𝑍, 𝐵, 1)) |
| 10 | iprodn0.6 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) | |
| 11 | 1, 2, 3, 4, 5, 9, 10 | zprodn0 15898 | 1 ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 𝐵 = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ifcif 4467 class class class wbr 5086 ‘cfv 6493 ℂcc 11030 0cc0 11032 1c1 11033 · cmul 11037 ℤcz 12518 ℤ≥cuz 12782 seqcseq 13957 ⇝ cli 15440 ∏cprod 15862 |
| 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 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-inf2 9556 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-pre-sup 11110 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-oi 9419 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-n0 12432 df-z 12519 df-uz 12783 df-rp 12937 df-fz 13456 df-fzo 13603 df-seq 13958 df-exp 14018 df-hash 14287 df-cj 15055 df-re 15056 df-im 15057 df-sqrt 15191 df-abs 15192 df-clim 15444 df-prod 15863 |
| This theorem is referenced by: iprodefisum 35942 iprodfac 35948 |
| Copyright terms: Public domain | W3C validator |