Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gsumbagdiag | Structured version Visualization version GIF version |
Description: Two-dimensional commutation of a group sum over a "triangular" region. fsum0diag 15126 analogue for finite bags. (Contributed by Mario Carneiro, 5-Jan-2015.) |
Ref | Expression |
---|---|
psrbag.d | ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} |
psrbagconf1o.1 | ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} |
gsumbagdiag.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
gsumbagdiag.f | ⊢ (𝜑 → 𝐹 ∈ 𝐷) |
gsumbagdiag.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumbagdiag.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
gsumbagdiag.x | ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑋 ∈ 𝐵) |
Ref | Expression |
---|---|
gsumbagdiag | ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝑆, 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ↦ 𝑋)) = (𝐺 Σg (𝑘 ∈ 𝑆, 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)} ↦ 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumbagdiag.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
2 | eqid 2821 | . 2 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
3 | gsumbagdiag.g | . 2 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
4 | psrbagconf1o.1 | . . 3 ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} | |
5 | gsumbagdiag.i | . . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
6 | gsumbagdiag.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷) | |
7 | psrbag.d | . . . . 5 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
8 | 7 | psrbaglefi 20146 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝐷) → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} ∈ Fin) |
9 | 5, 6, 8 | syl2anc 586 | . . 3 ⊢ (𝜑 → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} ∈ Fin) |
10 | 4, 9 | eqeltrid 2917 | . 2 ⊢ (𝜑 → 𝑆 ∈ Fin) |
11 | ovex 7183 | . . . 4 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
12 | 7, 11 | rab2ex 5230 | . . 3 ⊢ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ∈ V |
13 | 12 | a1i 11 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑆) → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ∈ V) |
14 | gsumbagdiag.x | . 2 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑋 ∈ 𝐵) | |
15 | xpfi 8783 | . . 3 ⊢ ((𝑆 ∈ Fin ∧ 𝑆 ∈ Fin) → (𝑆 × 𝑆) ∈ Fin) | |
16 | 10, 10, 15 | syl2anc 586 | . 2 ⊢ (𝜑 → (𝑆 × 𝑆) ∈ Fin) |
17 | simprl 769 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑗 ∈ 𝑆) | |
18 | 7, 4, 5, 6 | gsumbagdiaglem 20149 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)})) |
19 | 18 | simpld 497 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑘 ∈ 𝑆) |
20 | brxp 5595 | . . . . 5 ⊢ (𝑗(𝑆 × 𝑆)𝑘 ↔ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) | |
21 | 17, 19, 20 | sylanbrc 585 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑗(𝑆 × 𝑆)𝑘) |
22 | 21 | pm2.24d 154 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → (¬ 𝑗(𝑆 × 𝑆)𝑘 → 𝑋 = (0g‘𝐺))) |
23 | 22 | impr 457 | . 2 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)}) ∧ ¬ 𝑗(𝑆 × 𝑆)𝑘)) → 𝑋 = (0g‘𝐺)) |
24 | 7, 4, 5, 6 | gsumbagdiaglem 20149 | . . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)})) → (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) |
25 | 18, 24 | impbida 799 | . 2 ⊢ (𝜑 → ((𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)}) ↔ (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)}))) |
26 | 1, 2, 3, 10, 13, 14, 16, 23, 10, 25 | gsumcom2 19089 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝑆, 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ↦ 𝑋)) = (𝐺 Σg (𝑘 ∈ 𝑆, 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)} ↦ 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {crab 3142 Vcvv 3494 class class class wbr 5058 × cxp 5547 ◡ccnv 5548 “ cima 5552 ‘cfv 6349 (class class class)co 7150 ∈ cmpo 7152 ∘f cof 7401 ∘r cofr 7402 ↑m cmap 8400 Fincfn 8503 ≤ cle 10670 − cmin 10864 ℕcn 11632 ℕ0cn0 11891 Basecbs 16477 0gc0g 16707 Σg cgsu 16708 CMndccmn 18900 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-of 7403 df-ofr 7404 df-om 7575 df-1st 7683 df-2nd 7684 df-supp 7825 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-ixp 8456 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-fsupp 8828 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-fzo 13028 df-seq 13364 df-hash 13685 df-0g 16709 df-gsum 16710 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-cntz 18441 df-cmn 18902 |
This theorem is referenced by: psrass1lem 20151 |
Copyright terms: Public domain | W3C validator |