| 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 12729 | . 2 ⊢ 1 ∈ ℤ | |
| 2 | nnuz 13007 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 3 | id 23 | . . 3 ⊢ (1 ∈ ℤ → 1 ∈ ℤ) | |
| 4 | ax-1ne0 11272 | . . . 4 ⊢ 1 ≠ 0 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → 1 ≠ 0) |
| 6 | 2 | prodfclim1 16067 | . . 3 ⊢ (1 ∈ ℤ → seq1( · , (ℕ × {1})) ⇝ 1) |
| 7 | 0ss 4349 | . . . 4 ⊢ ∅ ⊆ ℕ | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → ∅ ⊆ ℕ) |
| 9 | fvconst2g 7208 | . . . 4 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = 1) | |
| 10 | noel 4283 | . . . . 5 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 4491 | . . . 4 ⊢ if(𝑘 ∈ ∅, 𝐴, 1) = 1 |
| 12 | 9, 11 | eqtr4di 2813 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 1)) |
| 13 | 10 | pm2.21i 120 | . . . 4 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 14 | 13 | adantl 487 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 15 | 2, 3, 5, 6, 8, 12, 14 | zprodn0 16111 | . 2 ⊢ (1 ∈ ℤ → ∏𝑘 ∈ ∅ 𝐴 = 1) |
| 16 | 1, 15 | ax-mp 5 | 1 ⊢ ∏𝑘 ∈ ∅ 𝐴 = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ⊆ wss 3895 ∅c0 4278 ifcif 4481 {csn 4584 × cxp 5648 ‘cfv 6538 ℂcc 11201 0cc0 11203 1c1 11204 ℕcn 12338 ℤcz 12696 ∏cprod 16077 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9645 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-sup 9437 df-oi 9507 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-n0 12610 df-z 12697 df-uz 12969 df-rp 13124 df-fz 13643 df-fzo 13792 df-seq 14148 df-exp 14208 df-hash 14478 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-clim 15660 df-prod 16078 |
| This theorem is used by: prod1 16116 fprodf1o 16118 fprodcllem 16123 fprodmul 16132 fproddiv 16133 fprodfac 16145 fprodconst 16150 fprodn0 16151 fprod2d 16153 fprodmodd 16169 risefac0 16198 coprmprod 16841 coprmproddvds 16843 prmo0 17219 gausslemma2dlem4 27701 breprexp 35308 bcprod 36595 fprodexp 46699 fprodabs2 46700 mccl 46703 fprodcn 46705 fprodcncf 47003 dvmptfprod 47048 dvnprodlem3 47051 |
| Copyright terms: Public domain | W3C validator |