| 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 12622 | . 2 ⊢ 1 ∈ ℤ | |
| 2 | nnuz 12895 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 3 | id 22 | . . 3 ⊢ (1 ∈ ℤ → 1 ∈ ℤ) | |
| 4 | ax-1ne0 11198 | . . . 4 ⊢ 1 ≠ 0 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → 1 ≠ 0) |
| 6 | 2 | prodfclim1 15909 | . . 3 ⊢ (1 ∈ ℤ → seq1( · , (ℕ × {1})) ⇝ 1) |
| 7 | 0ss 4375 | . . . 4 ⊢ ∅ ⊆ ℕ | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → ∅ ⊆ ℕ) |
| 9 | fvconst2g 7194 | . . . 4 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = 1) | |
| 10 | noel 4313 | . . . . 5 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 4510 | . . . 4 ⊢ if(𝑘 ∈ ∅, 𝐴, 1) = 1 |
| 12 | 9, 11 | eqtr4di 2788 | . . 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 15955 | . 2 ⊢ (1 ∈ ℤ → ∏𝑘 ∈ ∅ 𝐴 = 1) |
| 16 | 1, 15 | ax-mp 5 | 1 ⊢ ∏𝑘 ∈ ∅ 𝐴 = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 ⊆ wss 3926 ∅c0 4308 ifcif 4500 {csn 4601 × cxp 5652 ‘cfv 6531 ℂcc 11127 0cc0 11129 1c1 11130 ℕcn 12240 ℤcz 12588 ∏cprod 15919 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-seq 14020 df-exp 14080 df-hash 14349 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-prod 15920 |
| This theorem is referenced by: prod1 15960 fprodf1o 15962 fprodcllem 15967 fprodmul 15976 fproddiv 15977 fprodfac 15989 fprodconst 15994 fprodn0 15995 fprod2d 15997 fprodmodd 16013 risefac0 16043 coprmprod 16680 coprmproddvds 16682 prmo0 17056 gausslemma2dlem4 27332 breprexp 34665 bcprod 35755 fprodexp 45623 fprodabs2 45624 mccl 45627 fprodcn 45629 fprodcncf 45929 dvmptfprod 45974 dvnprodlem3 45977 |
| Copyright terms: Public domain | W3C validator |