| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsummptif1n0 | 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. (Contributed by AV, 17-Feb-2019.) (Proof shortened by AV, 11-Oct-2019.) |
| Ref | Expression |
|---|---|
| gsummpt1n0.0 | ⊢ 0 = (0g‘𝐺) |
| gsummpt1n0.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| gsummpt1n0.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| gsummpt1n0.x | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| gsummpt1n0.f | ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) |
| gsummptif1n0.a | ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐺)) |
| Ref | Expression |
|---|---|
| gsummptif1n0 | ⊢ (𝜑 → (𝐺 Σg 𝐹) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummpt1n0.0 | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 2 | gsummpt1n0.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 3 | gsummpt1n0.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 4 | gsummpt1n0.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 5 | gsummpt1n0.f | . . 3 ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) | |
| 6 | gsummptif1n0.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐺)) | |
| 7 | 6 | ralrimivw 3158 | . . 3 ⊢ (𝜑 → ∀𝑛 ∈ 𝐼 𝐴 ∈ (Base‘𝐺)) |
| 8 | 1, 2, 3, 4, 5, 7 | gsummpt1n0 20188 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ⦋𝑋 / 𝑛⦌𝐴) |
| 9 | csbconstg 3866 | . . 3 ⊢ (𝑋 ∈ 𝐼 → ⦋𝑋 / 𝑛⦌𝐴 = 𝐴) | |
| 10 | 4, 9 | syl 18 | . 2 ⊢ (𝜑 → ⦋𝑋 / 𝑛⦌𝐴 = 𝐴) |
| 11 | 8, 10 | eqtrd 2795 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ⦋csb 3847 ifcif 4481 ↦ cmpt 5185 ‘cfv 6543 (class class class)co 7424 Basecbs 17396 0gc0g 17619 Σg cgsu 17620 Mndcmnd 18932 |
| 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 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| 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 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 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-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-supp 8185 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-fsupp 9362 df-oi 9511 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-n0 12614 df-z 12701 df-uz 12973 df-fz 13647 df-fzo 13796 df-seq 14152 df-hash 14482 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-ress 17418 df-plusg 17450 df-0g 17621 df-gsum 17622 df-mre 17765 df-mrc 17766 df-acs 17768 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-submnd 18988 df-mulg 19287 df-cntz 19540 df-cmn 20005 |
| This theorem is used by: mhpvarcl 22478 1mavmul 22872 mulmarep1gsum1 22897 mdetdiag 22923 elrgspnlem2 33854 elrgspnlem3 33855 elrspunsn 34029 mplmulmvr 34221 esplyfval1 34255 esplyfvaln 34256 |
| Copyright terms: Public domain | W3C validator |