![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fprodconst | Structured version Visualization version GIF version |
Description: The product of constant terms (𝑘 is not free in 𝐵.) (Contributed by Scott Fenton, 12-Jan-2018.) |
Ref | Expression |
---|---|
fprodconst | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exp0 13187 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵↑0) = 1) | |
2 | 1 | eqcomd 2784 | . . . 4 ⊢ (𝐵 ∈ ℂ → 1 = (𝐵↑0)) |
3 | prodeq1 15051 | . . . . . 6 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑘 ∈ ∅ 𝐵) | |
4 | prod0 15085 | . . . . . 6 ⊢ ∏𝑘 ∈ ∅ 𝐵 = 1 | |
5 | 3, 4 | syl6eq 2830 | . . . . 5 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = 1) |
6 | fveq2 6448 | . . . . . . 7 ⊢ (𝐴 = ∅ → (♯‘𝐴) = (♯‘∅)) | |
7 | hash0 13479 | . . . . . . 7 ⊢ (♯‘∅) = 0 | |
8 | 6, 7 | syl6eq 2830 | . . . . . 6 ⊢ (𝐴 = ∅ → (♯‘𝐴) = 0) |
9 | 8 | oveq2d 6940 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐵↑(♯‘𝐴)) = (𝐵↑0)) |
10 | 5, 9 | eqeq12d 2793 | . . . 4 ⊢ (𝐴 = ∅ → (∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)) ↔ 1 = (𝐵↑0))) |
11 | 2, 10 | syl5ibrcom 239 | . . 3 ⊢ (𝐵 ∈ ℂ → (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))) |
12 | 11 | adantl 475 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))) |
13 | eqidd 2779 | . . . . . . 7 ⊢ (𝑘 = (𝑓‘𝑛) → 𝐵 = 𝐵) | |
14 | simprl 761 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ ℕ) | |
15 | simprr 763 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) | |
16 | simpllr 766 | . . . . . . 7 ⊢ ((((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
17 | simpllr 766 | . . . . . . . 8 ⊢ ((((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → 𝐵 ∈ ℂ) | |
18 | elfznn 12692 | . . . . . . . . 9 ⊢ (𝑛 ∈ (1...(♯‘𝐴)) → 𝑛 ∈ ℕ) | |
19 | 18 | adantl 475 | . . . . . . . 8 ⊢ ((((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → 𝑛 ∈ ℕ) |
20 | fvconst2g 6741 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℂ ∧ 𝑛 ∈ ℕ) → ((ℕ × {𝐵})‘𝑛) = 𝐵) | |
21 | 17, 19, 20 | syl2anc 579 | . . . . . . 7 ⊢ ((((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((ℕ × {𝐵})‘𝑛) = 𝐵) |
22 | 13, 14, 15, 16, 21 | fprod 15083 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑘 ∈ 𝐴 𝐵 = (seq1( · , (ℕ × {𝐵}))‘(♯‘𝐴))) |
23 | expnnval 13186 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ (♯‘𝐴) ∈ ℕ) → (𝐵↑(♯‘𝐴)) = (seq1( · , (ℕ × {𝐵}))‘(♯‘𝐴))) | |
24 | 23 | ad2ant2lr 738 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐵↑(♯‘𝐴)) = (seq1( · , (ℕ × {𝐵}))‘(♯‘𝐴))) |
25 | 22, 24 | eqtr4d 2817 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴))) |
26 | 25 | expr 450 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))) |
27 | 26 | exlimdv 1976 | . . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))) |
28 | 27 | expimpd 447 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))) |
29 | fz1f1o 14857 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) | |
30 | 29 | adantr 474 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
31 | 12, 28, 30 | mpjaod 849 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∨ wo 836 = wceq 1601 ∃wex 1823 ∈ wcel 2107 ∅c0 4141 {csn 4398 × cxp 5355 –1-1-onto→wf1o 6136 ‘cfv 6137 (class class class)co 6924 Fincfn 8243 ℂcc 10272 0cc0 10274 1c1 10275 · cmul 10279 ℕcn 11379 ...cfz 12648 seqcseq 13124 ↑cexp 13183 ♯chash 13441 ∏cprod 15047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-inf2 8837 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-mulcom 10338 ax-addass 10339 ax-mulass 10340 ax-distr 10341 ax-i2m1 10342 ax-1ne0 10343 ax-1rid 10344 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 ax-pre-ltadd 10350 ax-pre-mulgt0 10351 ax-pre-sup 10352 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-int 4713 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-se 5317 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-isom 6146 df-riota 6885 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-om 7346 df-1st 7447 df-2nd 7448 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-1o 7845 df-oadd 7849 df-er 8028 df-en 8244 df-dom 8245 df-sdom 8246 df-fin 8247 df-sup 8638 df-oi 8706 df-card 9100 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-sub 10610 df-neg 10611 df-div 11036 df-nn 11380 df-2 11443 df-3 11444 df-n0 11648 df-z 11734 df-uz 11998 df-rp 12143 df-fz 12649 df-fzo 12790 df-seq 13125 df-exp 13184 df-hash 13442 df-cj 14252 df-re 14253 df-im 14254 df-sqrt 14388 df-abs 14389 df-clim 14636 df-prod 15048 |
This theorem is referenced by: risefallfac 15166 gausslemma2dlem5 25559 gausslemma2dlem6 25560 breprexpnat 31322 circlemethnat 31329 circlevma 31330 circlemethhgt 31331 bcprod 32226 etransclem23 41415 hoicvrrex 41711 ovnhoilem1 41756 vonsn 41846 |
Copyright terms: Public domain | W3C validator |