| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsummpt1n0 | Structured version Visualization version GIF version | ||
| Description: If only one summand in a finite group sum is not zero, the whole sum equals this summand. More general version of gsummptif1n0 20210. (Contributed by AV, 11-Oct-2019.) |
| Ref | Expression |
|---|---|
| gsummpt1n0.0 | ⊢ 0 = (0g‘𝐺) |
| gsummpt1n0.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| gsummpt1n0.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| gsummpt1n0.x | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| gsummpt1n0.f | ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) |
| gsummpt1n0.a | ⊢ (𝜑 → ∀𝑛 ∈ 𝐼 𝐴 ∈ (Base‘𝐺)) |
| Ref | Expression |
|---|---|
| gsummpt1n0 | ⊢ (𝜑 → (𝐺 Σg 𝐹) = ⦋𝑋 / 𝑛⦌𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | gsummpt1n0.0 | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 3 | gsummpt1n0.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 4 | gsummpt1n0.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 5 | gsummpt1n0.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 6 | gsummpt1n0.a | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ 𝐼 𝐴 ∈ (Base‘𝐺)) | |
| 7 | 6 | r19.21bi 3258 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → 𝐴 ∈ (Base‘𝐺)) |
| 8 | 1, 2 | mndidcl 18968 | . . . . . . 7 ⊢ (𝐺 ∈ Mnd → 0 ∈ (Base‘𝐺)) |
| 9 | 3, 8 | syl 18 | . . . . . 6 ⊢ (𝜑 → 0 ∈ (Base‘𝐺)) |
| 10 | 9 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → 0 ∈ (Base‘𝐺)) |
| 11 | 7, 10 | ifcld 4532 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → if(𝑛 = 𝑋, 𝐴, 0 ) ∈ (Base‘𝐺)) |
| 12 | gsummpt1n0.f | . . . 4 ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) | |
| 13 | 11, 12 | fmptd 7138 | . . 3 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺)) |
| 14 | 12 | oveq1i 7453 | . . . 4 ⊢ (𝐹 supp 0 ) = ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) supp 0 ) |
| 15 | eldifsni 4753 | . . . . . . 7 ⊢ (𝑛 ∈ (𝐼 ∖ {𝑋}) → 𝑛 ≠ 𝑋) | |
| 16 | 15 | adantl 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐼 ∖ {𝑋})) → 𝑛 ≠ 𝑋) |
| 17 | ifnefalse 4497 | . . . . . 6 ⊢ (𝑛 ≠ 𝑋 → if(𝑛 = 𝑋, 𝐴, 0 ) = 0 ) | |
| 18 | 16, 17 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐼 ∖ {𝑋})) → if(𝑛 = 𝑋, 𝐴, 0 ) = 0 ) |
| 19 | 18, 4 | suppss2 8245 | . . . 4 ⊢ (𝜑 → ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) |
| 20 | 14, 19 | eqsstrid 3951 | . . 3 ⊢ (𝜑 → (𝐹 supp 0 ) ⊆ {𝑋}) |
| 21 | 1, 2, 3, 4, 5, 13, 20 | gsumpt 20206 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐹‘𝑋)) |
| 22 | nfcv 2926 | . . . . 5 ⊢ Ⅎ𝑦if(𝑛 = 𝑋, 𝐴, 0 ) | |
| 23 | nfv 1949 | . . . . . 6 ⊢ Ⅎ𝑛 𝑦 = 𝑋 | |
| 24 | nfcsb1v 3875 | . . . . . 6 ⊢ Ⅎ𝑛⦋𝑦 / 𝑛⦌𝐴 | |
| 25 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑛 0 | |
| 26 | 23, 24, 25 | nfif 4516 | . . . . 5 ⊢ Ⅎ𝑛if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 ) |
| 27 | eqeq1 2767 | . . . . . 6 ⊢ (𝑛 = 𝑦 → (𝑛 = 𝑋 ↔ 𝑦 = 𝑋)) | |
| 28 | csbeq1a 3865 | . . . . . 6 ⊢ (𝑛 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑛⦌𝐴) | |
| 29 | 27, 28 | ifbieq1d 4510 | . . . . 5 ⊢ (𝑛 = 𝑦 → if(𝑛 = 𝑋, 𝐴, 0 ) = if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 )) |
| 30 | 22, 26, 29 | cbvmpt 5210 | . . . 4 ⊢ (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 )) |
| 31 | 12, 30 | eqtri 2786 | . . 3 ⊢ 𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 )) |
| 32 | iftrue 4491 | . . . 4 ⊢ (𝑦 = 𝑋 → if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 ) = ⦋𝑦 / 𝑛⦌𝐴) | |
| 33 | csbeq1 3854 | . . . 4 ⊢ (𝑦 = 𝑋 → ⦋𝑦 / 𝑛⦌𝐴 = ⦋𝑋 / 𝑛⦌𝐴) | |
| 34 | 32, 33 | eqtrd 2798 | . . 3 ⊢ (𝑦 = 𝑋 → if(𝑦 = 𝑋, ⦋𝑦 / 𝑛⦌𝐴, 0 ) = ⦋𝑋 / 𝑛⦌𝐴) |
| 35 | rspcsbela 4399 | . . . 4 ⊢ ((𝑋 ∈ 𝐼 ∧ ∀𝑛 ∈ 𝐼 𝐴 ∈ (Base‘𝐺)) → ⦋𝑋 / 𝑛⦌𝐴 ∈ (Base‘𝐺)) | |
| 36 | 5, 6, 35 | syl2anc 596 | . . 3 ⊢ (𝜑 → ⦋𝑋 / 𝑛⦌𝐴 ∈ (Base‘𝐺)) |
| 37 | 31, 34, 5, 36 | fvmptd3 7040 | . 2 ⊢ (𝜑 → (𝐹‘𝑋) = ⦋𝑋 / 𝑛⦌𝐴) |
| 38 | 21, 37 | eqtrd 2798 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ⦋𝑋 / 𝑛⦌𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ⦋csb 3851 ∖ cdif 4048 ifcif 4485 {csn 4588 ↦ cmpt 5189 ‘cfv 6558 (class class class)co 7443 supp csupp 8204 Basecbs 17416 0gc0g 17639 Σg cgsu 17640 Mndcmnd 18952 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-isom 6567 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-supp 8205 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-fsupp 9382 df-oi 9531 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-n0 12634 df-z 12721 df-uz 12993 df-fz 13667 df-fzo 13816 df-seq 14172 df-hash 14502 df-sets 17371 df-slot 17389 df-ndx 17401 df-base 17417 df-ress 17438 df-plusg 17470 df-0g 17641 df-gsum 17642 df-mre 17785 df-mrc 17786 df-acs 17788 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-submnd 19008 df-mulg 19307 df-cntz 19561 df-cmn 20026 |
| This theorem is used by: gsummptif1n0 20210 gsummoncoe1 22656 scmatscm 22858 idpm2idmp 23149 mp2pm2mplem4 23157 monmat2matmon 23172 |
| Copyright terms: Public domain | W3C validator |