![]() |
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 | fovrnda 7299 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (𝑗𝐹𝑘) ∈ 𝐵) |
8 | gsumxp2.w | . . . 4 ⊢ (𝜑 → 𝐹 finSupp 0 ) | |
9 | 8 | fsuppimpd 8824 | . . 3 ⊢ (𝜑 → (𝐹 supp 0 ) ∈ Fin) |
10 | simpl 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝜑) | |
11 | opelxpi 5556 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) | |
12 | 11 | ad2antlr 726 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) |
13 | simpr 488 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
14 | 12, 13 | eldifd 3892 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) |
15 | ssidd 3938 | . . . . . . . 8 ⊢ (𝜑 → (𝐹 supp 0 ) ⊆ (𝐹 supp 0 )) | |
16 | 4, 5 | xpexd 7454 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 × 𝐶) ∈ V) |
17 | 2 | fvexi 6659 | . . . . . . . . 9 ⊢ 0 ∈ V |
18 | 17 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 0 ∈ V) |
19 | 6, 15, 16, 18 | suppssr 7844 | . . . . . . 7 ⊢ ((𝜑 ∧ 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
20 | 10, 14, 19 | syl2an2r 684 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
21 | 20 | ex 416 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 ) → (𝐹‘〈𝑗, 𝑘〉) = 0 )) |
22 | df-br 5031 | . . . . . 6 ⊢ (𝑗(𝐹 supp 0 )𝑘 ↔ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
23 | 22 | notbii 323 | . . . . 5 ⊢ (¬ 𝑗(𝐹 supp 0 )𝑘 ↔ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) |
24 | df-ov 7138 | . . . . . 6 ⊢ (𝑗𝐹𝑘) = (𝐹‘〈𝑗, 𝑘〉) | |
25 | 24 | eqeq1i 2803 | . . . . 5 ⊢ ((𝑗𝐹𝑘) = 0 ↔ (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
26 | 21, 23, 25 | 3imtr4g 299 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (¬ 𝑗(𝐹 supp 0 )𝑘 → (𝑗𝐹𝑘) = 0 )) |
27 | 26 | impr 458 | . . 3 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗(𝐹 supp 0 )𝑘)) → (𝑗𝐹𝑘) = 0 ) |
28 | 1, 2, 3, 4, 5, 7, 9, 27 | gsumcom3 19091 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘)))))) |
29 | 28 | eqcomd 2804 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∖ cdif 3878 〈cop 4531 class class class wbr 5030 ↦ cmpt 5110 × cxp 5517 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 supp csupp 7813 finSupp cfsupp 8817 Basecbs 16475 0gc0g 16705 Σg cgsu 16706 CMndccmn 18898 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-of 7389 df-om 7561 df-1st 7671 df-2nd 7672 df-supp 7814 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-fsupp 8818 df-oi 8958 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-seq 13365 df-hash 13687 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-0g 16707 df-gsum 16708 df-mre 16849 df-mrc 16850 df-acs 16852 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-submnd 17949 df-mulg 18217 df-cntz 18439 df-cmn 18900 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |