| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumcom3 | Structured version Visualization version GIF version | ||
| Description: A commutative law for finitely supported iterated sums. (Contributed by Stefan O'Rear, 2-Nov-2015.) |
| Ref | Expression |
|---|---|
| gsumcom3.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumcom3.z | ⊢ 0 = (0g‘𝐺) |
| gsumcom3.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| gsumcom3.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| gsumcom3.r | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
| gsumcom3.f | ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵) |
| gsumcom3.u | ⊢ (𝜑 → 𝑈 ∈ Fin) |
| gsumcom3.n | ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) → 𝑋 = 0 ) |
| Ref | Expression |
|---|---|
| gsumcom3 | ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑋)))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ 𝑋))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumcom3.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsumcom3.z | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 3 | gsumcom3.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 4 | gsumcom3.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 5 | gsumcom3.r | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 6 | gsumcom3.f | . . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵) | |
| 7 | gsumcom3.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ Fin) | |
| 8 | gsumcom3.n | . . 3 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) → 𝑋 = 0 ) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | gsumcom 20035 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)) = (𝐺 Σg (𝑘 ∈ 𝐶, 𝑗 ∈ 𝐴 ↦ 𝑋))) |
| 10 | 5 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑊) |
| 11 | 1, 2, 3, 4, 10, 6, 7, 8 | gsum2d2 20032 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑋))))) |
| 12 | 4 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝐴 ∈ 𝑉) |
| 13 | 6 | ancom2s 662 | . . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐶 ∧ 𝑗 ∈ 𝐴)) → 𝑋 ∈ 𝐵) |
| 14 | cnvfi 9148 | . . . 4 ⊢ (𝑈 ∈ Fin → ◡𝑈 ∈ Fin) | |
| 15 | 7, 14 | syl 18 | . . 3 ⊢ (𝜑 → ◡𝑈 ∈ Fin) |
| 16 | ancom 465 | . . . . 5 ⊢ ((𝑘 ∈ 𝐶 ∧ 𝑗 ∈ 𝐴) ↔ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) | |
| 17 | vex 3461 | . . . . . . 7 ⊢ 𝑘 ∈ V | |
| 18 | vex 3461 | . . . . . . 7 ⊢ 𝑗 ∈ V | |
| 19 | 17, 18 | brcnv 5858 | . . . . . 6 ⊢ (𝑘◡𝑈𝑗 ↔ 𝑗𝑈𝑘) |
| 20 | 19 | notbii 323 | . . . . 5 ⊢ (¬ 𝑘◡𝑈𝑗 ↔ ¬ 𝑗𝑈𝑘) |
| 21 | 16, 20 | anbi12i 639 | . . . 4 ⊢ (((𝑘 ∈ 𝐶 ∧ 𝑗 ∈ 𝐴) ∧ ¬ 𝑘◡𝑈𝑗) ↔ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) |
| 22 | 21, 8 | sylan2b 605 | . . 3 ⊢ ((𝜑 ∧ ((𝑘 ∈ 𝐶 ∧ 𝑗 ∈ 𝐴) ∧ ¬ 𝑘◡𝑈𝑗)) → 𝑋 = 0 ) |
| 23 | 1, 2, 3, 5, 12, 13, 15, 22 | gsum2d2 20032 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐶, 𝑗 ∈ 𝐴 ↦ 𝑋)) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ 𝑋))))) |
| 24 | 9, 11, 23 | 3eqtr3d 2808 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑋)))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝐺 Σg (𝑗 ∈ 𝐴 ↦ 𝑋))))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 class class class wbr 5104 ↦ cmpt 5185 ◡ccnv 5650 ‘cfv 6525 (class class class)co 7400 ∈ cmpo 7402 Fincfn 8931 Basecbs 17257 0gc0g 17480 Σg cgsu 17481 CMndccmn 19838 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-of 7664 df-om 7851 df-1st 7974 df-2nd 7975 df-supp 8145 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fsupp 9310 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-2 12291 df-n0 12493 df-z 12580 df-uz 12851 df-fz 13524 df-fzo 13671 df-seq 14026 df-hash 14355 df-sets 17212 df-slot 17230 df-ndx 17242 df-base 17258 df-ress 17279 df-plusg 17311 df-0g 17482 df-gsum 17483 df-mre 17626 df-mrc 17627 df-acs 17629 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-submnd 18830 df-mulg 19122 df-cntz 19375 df-cmn 19840 |
| This theorem is referenced by: gsumcom3fi 20037 gsumxp2 20038 fldextrspunlsplem 33975 |
| Copyright terms: Public domain | W3C validator |