| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fprodn0f | Structured version Visualization version GIF version | ||
| Description: A finite product of nonzero terms is nonzero. A version of fprodn0 16035 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
| Ref | Expression |
|---|---|
| fprodn0f.kph | ⊢ Ⅎ𝑘𝜑 |
| fprodn0f.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| fprodn0f.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| fprodn0f.bne0 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≠ 0) |
| Ref | Expression |
|---|---|
| fprodn0f | ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fprodn0f.kph | . . 3 ⊢ Ⅎ𝑘𝜑 | |
| 2 | difssd 4092 | . . 3 ⊢ (𝜑 → (ℂ ∖ {0}) ⊆ ℂ) | |
| 3 | eldifi 4086 | . . . . . . 7 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ∈ ℂ) | |
| 4 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ∈ ℂ) |
| 5 | eldifi 4086 | . . . . . . 7 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ∈ ℂ) | |
| 6 | 5 | adantl 486 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ∈ ℂ) |
| 7 | 4, 6 | mulcld 11230 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ ℂ) |
| 8 | eldifsni 4759 | . . . . . . . . 9 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ≠ 0) | |
| 9 | 8 | adantr 485 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ≠ 0) |
| 10 | eldifsni 4759 | . . . . . . . . 9 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ≠ 0) | |
| 11 | 10 | adantl 486 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ≠ 0) |
| 12 | 4, 6, 9, 11 | mulne0d 11867 | . . . . . . 7 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ≠ 0) |
| 13 | 12 | neneqd 2963 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) = 0) |
| 14 | ovex 7445 | . . . . . . 7 ⊢ (𝑥 · 𝑦) ∈ V | |
| 15 | 14 | elsn 4605 | . . . . . 6 ⊢ ((𝑥 · 𝑦) ∈ {0} ↔ (𝑥 · 𝑦) = 0) |
| 16 | 13, 15 | sylnibr 332 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) ∈ {0}) |
| 17 | 7, 16 | eldifd 3917 | . . . 4 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
| 18 | 17 | adantl 486 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
| 19 | fprodn0f.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 20 | fprodn0f.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 21 | fprodn0f.bne0 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≠ 0) | |
| 22 | 21 | neneqd 2963 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 = 0) |
| 23 | elsng 4604 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ {0} ↔ 𝐵 = 0)) | |
| 24 | 20, 23 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 ∈ {0} ↔ 𝐵 = 0)) |
| 25 | 22, 24 | mtbird 328 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 ∈ {0}) |
| 26 | 20, 25 | eldifd 3917 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ (ℂ ∖ {0})) |
| 27 | ax-1cn 11159 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 28 | ax-1ne0 11170 | . . . . . 6 ⊢ 1 ≠ 0 | |
| 29 | 1ex 11204 | . . . . . . 7 ⊢ 1 ∈ V | |
| 30 | 29 | elsn 4605 | . . . . . 6 ⊢ (1 ∈ {0} ↔ 1 = 0) |
| 31 | 28, 30 | nemtbir 3054 | . . . . 5 ⊢ ¬ 1 ∈ {0} |
| 32 | eldif 3916 | . . . . 5 ⊢ (1 ∈ (ℂ ∖ {0}) ↔ (1 ∈ ℂ ∧ ¬ 1 ∈ {0})) | |
| 33 | 27, 31, 32 | mpbir2an 723 | . . . 4 ⊢ 1 ∈ (ℂ ∖ {0}) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ (ℂ ∖ {0})) |
| 35 | 1, 2, 18, 19, 26, 34 | fprodcllemf 16014 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ (ℂ ∖ {0})) |
| 36 | eldifsni 4759 | . 2 ⊢ (∏𝑘 ∈ 𝐴 𝐵 ∈ (ℂ ∖ {0}) → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0) | |
| 37 | 35, 36 | syl 18 | 1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 ≠ wne 2958 ∖ cdif 3903 {csn 4590 (class class class)co 7412 Fincfn 8944 ℂcc 11099 0cc0 11101 1c1 11102 · cmul 11106 ∏cprod 15959 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-oi 9473 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fzo 13685 df-seq 14040 df-exp 14100 df-hash 14369 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-prod 15960 |
| This theorem is referenced by: fprodle 16052 |
| Copyright terms: Public domain | W3C validator |