| 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 16151 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 4073 | . . 3 ⊢ (𝜑 → (ℂ ∖ {0}) ⊆ ℂ) | |
| 3 | eldifi 4067 | . . . . . . 7 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ∈ ℂ) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ∈ ℂ) |
| 5 | eldifi 4067 | . . . . . . 7 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ∈ ℂ) | |
| 6 | 5 | adantl 487 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ∈ ℂ) |
| 7 | 4, 6 | mulcld 11332 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ∈ ℂ) |
| 8 | eldifsni 4749 | . . . . . . . . 9 ⊢ (𝑥 ∈ (ℂ ∖ {0}) → 𝑥 ≠ 0) | |
| 9 | 8 | adantr 486 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑥 ≠ 0) |
| 10 | eldifsni 4749 | . . . . . . . . 9 ⊢ (𝑦 ∈ (ℂ ∖ {0}) → 𝑦 ≠ 0) | |
| 11 | 10 | adantl 487 | . . . . . . . 8 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → 𝑦 ≠ 0) |
| 12 | 4, 6, 9, 11 | mulne0d 11971 | . . . . . . 7 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → (𝑥 · 𝑦) ≠ 0) |
| 13 | 12 | neneqd 2960 | . . . . . 6 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) = 0) |
| 14 | ovex 7453 | . . . . . . 7 ⊢ (𝑥 · 𝑦) ∈ V | |
| 15 | 14 | elsn 4595 | . . . . . 6 ⊢ ((𝑥 · 𝑦) ∈ {0} ↔ (𝑥 · 𝑦) = 0) |
| 16 | 13, 15 | sylnibr 332 | . . . . 5 ⊢ ((𝑥 ∈ (ℂ ∖ {0}) ∧ 𝑦 ∈ (ℂ ∖ {0})) → ¬ (𝑥 · 𝑦) ∈ {0}) |
| 17 | 7, 16 | eldifd 4050 | . . . 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 2960 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 = 0) |
| 23 | elsng 4594 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ {0} ↔ 𝐵 = 0)) | |
| 24 | 20, 23 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 ∈ {0} ↔ 𝐵 = 0)) |
| 25 | 22, 24 | mtbird 328 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝐵 ∈ {0}) |
| 26 | 20, 25 | eldifd 4050 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ (ℂ ∖ {0})) |
| 27 | ax-1cn 11261 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 28 | ax-1ne0 11272 | . . . . . 6 ⊢ 1 ≠ 0 | |
| 29 | 1ex 11306 | . . . . . . 7 ⊢ 1 ∈ V | |
| 30 | 29 | elsn 4595 | . . . . . 6 ⊢ (1 ∈ {0} ↔ 1 = 0) |
| 31 | 28, 30 | nemtbir 3051 | . . . . 5 ⊢ ¬ 1 ∈ {0} |
| 32 | eldif 4049 | . . . . 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 16130 | . 2 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ (ℂ ∖ {0})) |
| 36 | eldifsni 4749 | . 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 1569 Ⅎwnf 1815 ∈ wcel 2144 ≠ wne 2955 ∖ cdif 4045 {csn 4584 (class class class)co 7420 Fincfn 8976 ℂcc 11201 0cc0 11203 1c1 11204 · cmul 11208 ∏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: fprodle 16168 |
| Copyright terms: Public domain | W3C validator |