| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prod0 | Structured version Visualization version GIF version | ||
| Description: A product over the empty set is one. (Contributed by Scott Fenton, 5-Dec-2017.) |
| Ref | Expression |
|---|---|
| prod0 | ⊢ ∏𝑘 ∈ ∅ 𝐴 = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1z 12523 | . 2 ⊢ 1 ∈ ℤ | |
| 2 | nnuz 12796 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 3 | id 22 | . . 3 ⊢ (1 ∈ ℤ → 1 ∈ ℤ) | |
| 4 | ax-1ne0 11097 | . . . 4 ⊢ 1 ≠ 0 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → 1 ≠ 0) |
| 6 | 2 | prodfclim1 15818 | . . 3 ⊢ (1 ∈ ℤ → seq1( · , (ℕ × {1})) ⇝ 1) |
| 7 | 0ss 4353 | . . . 4 ⊢ ∅ ⊆ ℕ | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → ∅ ⊆ ℕ) |
| 9 | fvconst2g 7142 | . . . 4 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = 1) | |
| 10 | noel 4291 | . . . . 5 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 4488 | . . . 4 ⊢ if(𝑘 ∈ ∅, 𝐴, 1) = 1 |
| 12 | 9, 11 | eqtr4di 2782 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 1)) |
| 13 | 10 | pm2.21i 119 | . . . 4 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 15 | 2, 3, 5, 6, 8, 12, 14 | zprodn0 15864 | . 2 ⊢ (1 ∈ ℤ → ∏𝑘 ∈ ∅ 𝐴 = 1) |
| 16 | 1, 15 | ax-mp 5 | 1 ⊢ ∏𝑘 ∈ ∅ 𝐴 = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ⊆ wss 3905 ∅c0 4286 ifcif 4478 {csn 4579 × cxp 5621 ‘cfv 6486 ℂcc 11026 0cc0 11028 1c1 11029 ℕcn 12146 ℤcz 12489 ∏cprod 15828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-inf2 9556 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 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 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 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-sup 9351 df-oi 9421 df-card 9854 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-n0 12403 df-z 12490 df-uz 12754 df-rp 12912 df-fz 13429 df-fzo 13576 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: prod1 15869 fprodf1o 15871 fprodcllem 15876 fprodmul 15885 fproddiv 15886 fprodfac 15898 fprodconst 15903 fprodn0 15904 fprod2d 15906 fprodmodd 15922 risefac0 15952 coprmprod 16590 coprmproddvds 16592 prmo0 16966 gausslemma2dlem4 27296 breprexp 34603 bcprod 35713 fprodexp 45579 fprodabs2 45580 mccl 45583 fprodcn 45585 fprodcncf 45885 dvmptfprod 45930 dvnprodlem3 45933 |
| Copyright terms: Public domain | W3C validator |