| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumxp2 | Structured version Visualization version GIF version | ||
| Description: Write a group sum over a cartesian product as a double sum in two ways. This corresponds to the first equation in [Lang] p. 6. (Contributed by AV, 27-Dec-2023.) |
| Ref | Expression |
|---|---|
| gsumxp2.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumxp2.z | ⊢ 0 = (0g‘𝐺) |
| gsumxp2.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| gsumxp2.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| gsumxp2.r | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
| gsumxp2.f | ⊢ (𝜑 → 𝐹:(𝐴 × 𝐶)⟶𝐵) |
| gsumxp2.w | ⊢ (𝜑 → 𝐹 finSupp 0 ) |
| Ref | Expression |
|---|---|
| gsumxp2 | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumxp2.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsumxp2.z | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 3 | gsumxp2.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 4 | gsumxp2.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 5 | gsumxp2.r | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 6 | gsumxp2.f | . . . 4 ⊢ (𝜑 → 𝐹:(𝐴 × 𝐶)⟶𝐵) | |
| 7 | 6 | fovcdmda 7531 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (𝑗𝐹𝑘) ∈ 𝐵) |
| 8 | gsumxp2.w | . . . 4 ⊢ (𝜑 → 𝐹 finSupp 0 ) | |
| 9 | 8 | fsuppimpd 9275 | . . 3 ⊢ (𝜑 → (𝐹 supp 0 ) ∈ Fin) |
| 10 | simpl 482 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝜑) | |
| 11 | opelxpi 5661 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) | |
| 12 | 11 | ad2antlr 728 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) |
| 13 | simpr 484 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
| 14 | 12, 13 | eldifd 3901 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) |
| 15 | ssidd 3946 | . . . . . . . 8 ⊢ (𝜑 → (𝐹 supp 0 ) ⊆ (𝐹 supp 0 )) | |
| 16 | 4, 5 | xpexd 7698 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 × 𝐶) ∈ V) |
| 17 | 2 | fvexi 6848 | . . . . . . . . 9 ⊢ 0 ∈ V |
| 18 | 17 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 0 ∈ V) |
| 19 | 6, 15, 16, 18 | suppssr 8138 | . . . . . . 7 ⊢ ((𝜑 ∧ 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
| 20 | 10, 14, 19 | syl2an2r 686 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
| 21 | 20 | ex 412 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 ) → (𝐹‘〈𝑗, 𝑘〉) = 0 )) |
| 22 | df-br 5087 | . . . . . 6 ⊢ (𝑗(𝐹 supp 0 )𝑘 ↔ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
| 23 | 22 | notbii 320 | . . . . 5 ⊢ (¬ 𝑗(𝐹 supp 0 )𝑘 ↔ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) |
| 24 | df-ov 7363 | . . . . . 6 ⊢ (𝑗𝐹𝑘) = (𝐹‘〈𝑗, 𝑘〉) | |
| 25 | 24 | eqeq1i 2742 | . . . . 5 ⊢ ((𝑗𝐹𝑘) = 0 ↔ (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
| 26 | 21, 23, 25 | 3imtr4g 296 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (¬ 𝑗(𝐹 supp 0 )𝑘 → (𝑗𝐹𝑘) = 0 )) |
| 27 | 26 | impr 454 | . . 3 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗(𝐹 supp 0 )𝑘)) → (𝑗𝐹𝑘) = 0 ) |
| 28 | 1, 2, 3, 4, 5, 7, 9, 27 | gsumcom3 19944 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘)))))) |
| 29 | 28 | eqcomd 2743 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∖ cdif 3887 〈cop 4574 class class class wbr 5086 ↦ cmpt 5167 × cxp 5622 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 supp csupp 8103 finSupp cfsupp 9267 Basecbs 17170 0gc0g 17393 Σg cgsu 17394 CMndccmn 19746 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-oi 9418 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-0g 17395 df-gsum 17396 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-mulg 19035 df-cntz 19283 df-cmn 19748 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |