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 15120 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 2818 | . 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 20080 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝐷) → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} ∈ Fin) |
9 | 5, 6, 8 | syl2anc 584 | . . 3 ⊢ (𝜑 → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹} ∈ Fin) |
10 | 4, 9 | eqeltrid 2914 | . 2 ⊢ (𝜑 → 𝑆 ∈ Fin) |
11 | ovex 7178 | . . . 4 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
12 | 7, 11 | rab2ex 5229 | . . 3 ⊢ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ∈ V |
13 | 12 | a1i 11 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑆) → {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ∈ V) |
14 | gsumbagdiag.x | . 2 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑋 ∈ 𝐵) | |
15 | xpfi 8777 | . . 3 ⊢ ((𝑆 ∈ Fin ∧ 𝑆 ∈ Fin) → (𝑆 × 𝑆) ∈ Fin) | |
16 | 10, 10, 15 | syl2anc 584 | . 2 ⊢ (𝜑 → (𝑆 × 𝑆) ∈ Fin) |
17 | simprl 767 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑗 ∈ 𝑆) | |
18 | 7, 4, 5, 6 | gsumbagdiaglem 20083 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)})) |
19 | 18 | simpld 495 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑘 ∈ 𝑆) |
20 | brxp 5594 | . . . . 5 ⊢ (𝑗(𝑆 × 𝑆)𝑘 ↔ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) | |
21 | 17, 19, 20 | sylanbrc 583 | . . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → 𝑗(𝑆 × 𝑆)𝑘) |
22 | 21 | pm2.24d 154 | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) → (¬ 𝑗(𝑆 × 𝑆)𝑘 → 𝑋 = (0g‘𝐺))) |
23 | 22 | impr 455 | . 2 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)}) ∧ ¬ 𝑗(𝑆 × 𝑆)𝑘)) → 𝑋 = (0g‘𝐺)) |
24 | 7, 4, 5, 6 | gsumbagdiaglem 20083 | . . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)})) → (𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)})) |
25 | 18, 24 | impbida 797 | . 2 ⊢ (𝜑 → ((𝑗 ∈ 𝑆 ∧ 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)}) ↔ (𝑘 ∈ 𝑆 ∧ 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)}))) |
26 | 1, 2, 3, 10, 13, 14, 16, 23, 10, 25 | gsumcom2 19024 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝑆, 𝑘 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑗)} ↦ 𝑋)) = (𝐺 Σg (𝑘 ∈ 𝑆, 𝑗 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑘)} ↦ 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 {crab 3139 Vcvv 3492 class class class wbr 5057 × cxp 5546 ◡ccnv 5547 “ cima 5551 ‘cfv 6348 (class class class)co 7145 ∈ cmpo 7147 ∘f cof 7396 ∘r cofr 7397 ↑m cmap 8395 Fincfn 8497 ≤ cle 10664 − cmin 10858 ℕcn 11626 ℕ0cn0 11885 Basecbs 16471 0gc0g 16701 Σg cgsu 16702 CMndccmn 18835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-ofr 7399 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-er 8278 df-map 8397 df-pm 8398 df-ixp 8450 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-seq 13358 df-hash 13679 df-0g 16703 df-gsum 16704 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-cntz 18385 df-cmn 18837 |
This theorem is referenced by: psrass1lem 20085 |
Copyright terms: Public domain | W3C validator |