| 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 12598 | . 2 ⊢ 1 ∈ ℤ | |
| 2 | nnuz 12875 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 3 | id 22 | . . 3 ⊢ (1 ∈ ℤ → 1 ∈ ℤ) | |
| 4 | ax-1ne0 11139 | . . . 4 ⊢ 1 ≠ 0 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → 1 ≠ 0) |
| 6 | 2 | prodfclim1 15906 | . . 3 ⊢ (1 ∈ ℤ → seq1( · , (ℕ × {1})) ⇝ 1) |
| 7 | 0ss 4353 | . . . 4 ⊢ ∅ ⊆ ℕ | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (1 ∈ ℤ → ∅ ⊆ ℕ) |
| 9 | fvconst2g 7182 | . . . 4 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = 1) | |
| 10 | noel 4290 | . . . . 5 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 4489 | . . . 4 ⊢ if(𝑘 ∈ ∅, 𝐴, 1) = 1 |
| 12 | 9, 11 | eqtr4di 2814 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ℕ) → ((ℕ × {1})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 1)) |
| 13 | 10 | pm2.21i 119 | . . . 4 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 14 | 13 | adantl 485 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 15 | 2, 3, 5, 6, 8, 12, 14 | zprodn0 15952 | . 2 ⊢ (1 ∈ ℤ → ∏𝑘 ∈ ∅ 𝐴 = 1) |
| 16 | 1, 15 | ax-mp 5 | 1 ⊢ ∏𝑘 ∈ ∅ 𝐴 = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ⊆ wss 3904 ∅c0 4285 ifcif 4479 {csn 4581 × cxp 5643 ‘cfv 6517 ℂcc 11068 0cc0 11070 1c1 11071 ℕcn 12207 ℤcz 12565 ∏cprod 15916 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-inf2 9593 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-pre-sup 11148 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-isom 6526 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-sup 9385 df-oi 9455 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12208 df-2 12277 df-3 12278 df-n0 12479 df-z 12566 df-uz 12837 df-rp 12991 df-fz 13510 df-fzo 13657 df-seq 14012 df-exp 14072 df-hash 14341 df-cj 15109 df-re 15110 df-im 15111 df-sqrt 15245 df-abs 15246 df-clim 15498 df-prod 15917 |
| This theorem is referenced by: prod1 15957 fprodf1o 15959 fprodcllem 15964 fprodmul 15973 fproddiv 15974 fprodfac 15986 fprodconst 15991 fprodn0 15992 fprod2d 15994 fprodmodd 16010 risefac0 16040 coprmprod 16678 coprmproddvds 16680 prmo0 17055 gausslemma2dlem4 27410 breprexp 34891 bcprod 36052 fprodexp 46134 fprodabs2 46135 mccl 46138 fprodcn 46140 fprodcncf 46438 dvmptfprod 46483 dvnprodlem3 46486 |
| Copyright terms: Public domain | W3C validator |