| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gsumzresunsn | Structured version Visualization version GIF version | ||
| Description: Append an element to a finite group sum expressed as a function restriction. (Contributed by Thierry Arnoux, 20-Nov-2023.) |
| Ref | Expression |
|---|---|
| gsumzresunsn.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumzresunsn.p | ⊢ + = (+g‘𝐺) |
| gsumzresunsn.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| gsumzresunsn.y | ⊢ 𝑌 = (𝐹‘𝑋) |
| gsumzresunsn.f | ⊢ (𝜑 → 𝐹:𝐶⟶𝐵) |
| gsumzresunsn.1 | ⊢ (𝜑 → 𝐴 ⊆ 𝐶) |
| gsumzresunsn.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| gsumzresunsn.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| gsumzresunsn.2 | ⊢ (𝜑 → ¬ 𝑋 ∈ 𝐴) |
| gsumzresunsn.3 | ⊢ (𝜑 → 𝑋 ∈ 𝐶) |
| gsumzresunsn.4 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| gsumzresunsn.5 | ⊢ (𝜑 → (𝐹 “ (𝐴 ∪ {𝑋})) ⊆ (𝑍‘(𝐹 “ (𝐴 ∪ {𝑋})))) |
| Ref | Expression |
|---|---|
| gsumzresunsn | ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ (𝐴 ∪ {𝑋}))) = ((𝐺 Σg (𝐹 ↾ 𝐴)) + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumzresunsn.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsumzresunsn.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | gsumzresunsn.z | . . 3 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 4 | eqid 2737 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)) = (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)) | |
| 5 | gsumzresunsn.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 6 | gsumzresunsn.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 7 | gsumzresunsn.5 | . . . 4 ⊢ (𝜑 → (𝐹 “ (𝐴 ∪ {𝑋})) ⊆ (𝑍‘(𝐹 “ (𝐴 ∪ {𝑋})))) | |
| 8 | df-ima 5647 | . . . . 5 ⊢ (𝐹 “ (𝐴 ∪ {𝑋})) = ran (𝐹 ↾ (𝐴 ∪ {𝑋})) | |
| 9 | gsumzresunsn.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝐶⟶𝐵) | |
| 10 | gsumzresunsn.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ 𝐶) | |
| 11 | gsumzresunsn.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝐶) | |
| 12 | 11 | snssd 4767 | . . . . . . . 8 ⊢ (𝜑 → {𝑋} ⊆ 𝐶) |
| 13 | 10, 12 | unssd 4146 | . . . . . . 7 ⊢ (𝜑 → (𝐴 ∪ {𝑋}) ⊆ 𝐶) |
| 14 | 9, 13 | feqresmpt 6913 | . . . . . 6 ⊢ (𝜑 → (𝐹 ↾ (𝐴 ∪ {𝑋})) = (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥))) |
| 15 | 14 | rneqd 5897 | . . . . 5 ⊢ (𝜑 → ran (𝐹 ↾ (𝐴 ∪ {𝑋})) = ran (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥))) |
| 16 | 8, 15 | eqtrid 2784 | . . . 4 ⊢ (𝜑 → (𝐹 “ (𝐴 ∪ {𝑋})) = ran (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥))) |
| 17 | 16 | fveq2d 6848 | . . . 4 ⊢ (𝜑 → (𝑍‘(𝐹 “ (𝐴 ∪ {𝑋}))) = (𝑍‘ran (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)))) |
| 18 | 7, 16, 17 | 3sstr3d 3990 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)) ⊆ (𝑍‘ran (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)))) |
| 19 | 9 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐹:𝐶⟶𝐵) |
| 20 | 10 | sselda 3935 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐶) |
| 21 | 19, 20 | ffvelcdmd 7041 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
| 22 | gsumzresunsn.2 | . . 3 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝐴) | |
| 23 | gsumzresunsn.4 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 24 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋) | |
| 25 | 24 | fveq2d 6848 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (𝐹‘𝑥) = (𝐹‘𝑋)) |
| 26 | gsumzresunsn.y | . . . 4 ⊢ 𝑌 = (𝐹‘𝑋) | |
| 27 | 25, 26 | eqtr4di 2790 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (𝐹‘𝑥) = 𝑌) |
| 28 | 1, 2, 3, 4, 5, 6, 18, 21, 11, 22, 23, 27 | gsumzunsnd 19902 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥))) = ((𝐺 Σg (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) + 𝑌)) |
| 29 | 14 | oveq2d 7386 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ (𝐴 ∪ {𝑋}))) = (𝐺 Σg (𝑥 ∈ (𝐴 ∪ {𝑋}) ↦ (𝐹‘𝑥)))) |
| 30 | 9, 10 | feqresmpt 6913 | . . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
| 31 | 30 | oveq2d 7386 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ 𝐴)) = (𝐺 Σg (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))) |
| 32 | 31 | oveq1d 7385 | . 2 ⊢ (𝜑 → ((𝐺 Σg (𝐹 ↾ 𝐴)) + 𝑌) = ((𝐺 Σg (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) + 𝑌)) |
| 33 | 28, 29, 32 | 3eqtr4d 2782 | 1 ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ (𝐴 ∪ {𝑋}))) = ((𝐺 Σg (𝐹 ↾ 𝐴)) + 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∪ cun 3901 ⊆ wss 3903 {csn 4582 ↦ cmpt 5181 ran crn 5635 ↾ cres 5636 “ cima 5637 ⟶wf 6498 ‘cfv 6502 (class class class)co 7370 Fincfn 8897 Basecbs 17150 +gcplusg 17191 Σg cgsu 17374 Mndcmnd 18673 Cntzccntz 19261 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-of 7634 df-om 7821 df-1st 7945 df-2nd 7946 df-supp 8115 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-fsupp 9279 df-oi 9429 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-n0 12416 df-z 12503 df-uz 12766 df-fz 13438 df-fzo 13585 df-seq 13939 df-hash 14268 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-0g 17375 df-gsum 17376 df-mre 17519 df-mrc 17520 df-acs 17522 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-submnd 18723 df-mulg 19015 df-cntz 19263 df-cmn 19728 |
| This theorem is referenced by: rprmdvdsprod 33633 |
| Copyright terms: Public domain | W3C validator |