![]() |
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 7603 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (𝑗𝐹𝑘) ∈ 𝐵) |
8 | gsumxp2.w | . . . 4 ⊢ (𝜑 → 𝐹 finSupp 0 ) | |
9 | 8 | fsuppimpd 9406 | . . 3 ⊢ (𝜑 → (𝐹 supp 0 ) ∈ Fin) |
10 | simpl 482 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝜑) | |
11 | opelxpi 5725 | . . . . . . . . 9 ⊢ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) | |
12 | 11 | ad2antlr 727 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ (𝐴 × 𝐶)) |
13 | simpr 484 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
14 | 12, 13 | eldifd 3973 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) |
15 | ssidd 4018 | . . . . . . . 8 ⊢ (𝜑 → (𝐹 supp 0 ) ⊆ (𝐹 supp 0 )) | |
16 | 4, 5 | xpexd 7769 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 × 𝐶) ∈ V) |
17 | 2 | fvexi 6920 | . . . . . . . . 9 ⊢ 0 ∈ V |
18 | 17 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 0 ∈ V) |
19 | 6, 15, 16, 18 | suppssr 8218 | . . . . . . 7 ⊢ ((𝜑 ∧ 〈𝑗, 𝑘〉 ∈ ((𝐴 × 𝐶) ∖ (𝐹 supp 0 ))) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
20 | 10, 14, 19 | syl2an2r 685 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) ∧ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) → (𝐹‘〈𝑗, 𝑘〉) = 0 ) |
21 | 20 | ex 412 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → (¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 ) → (𝐹‘〈𝑗, 𝑘〉) = 0 )) |
22 | df-br 5148 | . . . . . 6 ⊢ (𝑗(𝐹 supp 0 )𝑘 ↔ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) | |
23 | 22 | notbii 320 | . . . . 5 ⊢ (¬ 𝑗(𝐹 supp 0 )𝑘 ↔ ¬ 〈𝑗, 𝑘〉 ∈ (𝐹 supp 0 )) |
24 | df-ov 7433 | . . . . . 6 ⊢ (𝑗𝐹𝑘) = (𝐹‘〈𝑗, 𝑘〉) | |
25 | 24 | eqeq1i 2739 | . . . . 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 20010 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘)))))) |
29 | 28 | eqcomd 2740 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 Vcvv 3477 ∖ cdif 3959 〈cop 4636 class class class wbr 5147 ↦ cmpt 5230 × cxp 5686 ⟶wf 6558 ‘cfv 6562 (class class class)co 7430 supp csupp 8183 finSupp cfsupp 9398 Basecbs 17244 0gc0g 17485 Σg cgsu 17486 CMndccmn 19812 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-iin 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-se 5641 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-isom 6571 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-of 7696 df-om 7887 df-1st 8012 df-2nd 8013 df-supp 8184 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-2o 8505 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-fin 8987 df-fsupp 9399 df-oi 9547 df-card 9976 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-2 12326 df-n0 12524 df-z 12611 df-uz 12876 df-fz 13544 df-fzo 13691 df-seq 14039 df-hash 14366 df-sets 17197 df-slot 17215 df-ndx 17227 df-base 17245 df-ress 17274 df-plusg 17310 df-0g 17487 df-gsum 17488 df-mre 17630 df-mrc 17631 df-acs 17633 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-mulg 19098 df-cntz 19347 df-cmn 19814 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |