| 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 16126 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 4084 | . . 3 ⊢ (𝜑 → (ℂ ∖ {0}) ⊆ ℂ) | |
| 3 | eldifi 4078 | . . . . . . 7 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ∈ ℂ) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ∈ ℂ) |
| 5 | eldifi 4078 | . . . . . . 7 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ∈ ℂ) | |
| 6 | 5 | adantl 487 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ∈ ℂ) |
| 7 | 4, 6 | mulcld 11310 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ ℂ) |
| 8 | eldifsni 4753 | . . . . . . . . 9 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ≠ 0) | |
| 9 | 8 | adantr 486 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ≠ 0) |
| 10 | eldifsni 4753 | . . . . . . . . 9 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ≠ 0) | |
| 11 | 10 | adantl 487 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ≠ 0) |
| 12 | 4, 6, 9, 11 | mulne0d 11949 | . . . . . . 7 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ≠ 0) |
| 13 | 12 | neneqd 2961 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) = 0) |
| 14 | ovex 7445 | . . . . . . 7 ⊢ (𝑥 · 𝑦) ∈ V | |
| 15 | 14 | elsn 4599 | . . . . . 6 ⊢ ((𝑥 · 𝑦) ∈ {0} ↔ (𝑥 · 𝑦) = 0) |
| 16 | 13, 15 | sylnibr 332 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) ∈ {0}) |
| 17 | 7, 16 | eldifd 3910 | . . . 4 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
| 18 | 17 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → (𝑥 · 𝑦) ∈ (ℂ ∖ {0})) |
| 19 | fprodn0f.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 20 | fprodn0f.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 21 | fprodn0f.bne0 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≠ 0) | |
| 22 | 21 | neneqd 2961 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 = 0) |
| 23 | elsng 4598 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ {0} ↔ 𝐵 = 0)) | |
| 24 | 20, 23 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 ∈ {0} ↔ 𝐵 = 0)) |
| 25 | 22, 24 | mtbird 328 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 ∈ {0}) |
| 26 | 20, 25 | eldifd 3910 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ (ℂ ∖ {0})) |
| 27 | ax-1cn 11239 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 28 | ax-1ne0 11250 | . . . . . 6 ⊢ 1 ≠ 0 | |
| 29 | 1ex 11284 | . . . . . . 7 ⊢ 1 ∈ V | |
| 30 | 29 | elsn 4599 | . . . . . 6 ⊢ (1 ∈ {0} ↔ 1 = 0) |
| 31 | 28, 30 | nemtbir 3052 | . . . . 5 ⊢ ¬ 1 ∈ {0} |
| 32 | eldif 3909 | . . . . 5 ⊢ (1 ∈ (ℂ ∖ {0}) ↔ (1 ∈ ℂ ∧ ¬ 1 ∈ {0})) | |
| 33 | 27, 31, 32 | mpbir2an 724 | . . . 4 ⊢ 1 ∈ (ℂ ∖ {0}) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ (ℂ ∖ {0})) |
| 35 | 1, 2, 18, 19, 26, 34 | fprodcllemf 16105 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ (ℂ ∖ {0})) |
| 36 | eldifsni 4753 | . 2 ⊢ (∏𝑘 ∈ 𝐴 𝐵 ∈ (ℂ ∖ {0}) → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0) | |
| 37 | 35, 36 | syl 18 | 1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 ≠ wne 2956 ∖ cdif 3896 {csn 4584 (class class class)co 7412 Fincfn 8957 ℂcc 11179 0cc0 11181 1c1 11182 · cmul 11186 ∏cprod 16052 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-oi 9488 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-fz 13621 df-fzo 13769 df-seq 14125 df-exp 14185 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-prod 16053 |
| This theorem is used by: fprodle 16143 |
| Copyright terms: Public domain | W3C validator |