![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gsumws1 | Structured version Visualization version GIF version |
Description: A singleton composite recovers the initial symbol. (Contributed by Stefan O'Rear, 16-Aug-2015.) |
Ref | Expression |
---|---|
gsumwcl.b | ⊢ 𝐵 = (Base‘𝐺) |
Ref | Expression |
---|---|
gsumws1 | ⊢ (𝑆 ∈ 𝐵 → (𝐺 Σg 〈“𝑆”〉) = 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s1val 14646 | . . 3 ⊢ (𝑆 ∈ 𝐵 → 〈“𝑆”〉 = {〈0, 𝑆〉}) | |
2 | 1 | oveq2d 7464 | . 2 ⊢ (𝑆 ∈ 𝐵 → (𝐺 Σg 〈“𝑆”〉) = (𝐺 Σg {〈0, 𝑆〉})) |
3 | gsumwcl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
4 | eqid 2740 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
5 | elfvdm 6957 | . . . 4 ⊢ (𝑆 ∈ (Base‘𝐺) → 𝐺 ∈ dom Base) | |
6 | 5, 3 | eleq2s 2862 | . . 3 ⊢ (𝑆 ∈ 𝐵 → 𝐺 ∈ dom Base) |
7 | 0nn0 12568 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
8 | nn0uz 12945 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
9 | 7, 8 | eleqtri 2842 | . . . 4 ⊢ 0 ∈ (ℤ≥‘0) |
10 | 9 | a1i 11 | . . 3 ⊢ (𝑆 ∈ 𝐵 → 0 ∈ (ℤ≥‘0)) |
11 | 0z 12650 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
12 | f1osng 6903 | . . . . . . 7 ⊢ ((0 ∈ ℤ ∧ 𝑆 ∈ 𝐵) → {〈0, 𝑆〉}:{0}–1-1-onto→{𝑆}) | |
13 | 11, 12 | mpan 689 | . . . . . 6 ⊢ (𝑆 ∈ 𝐵 → {〈0, 𝑆〉}:{0}–1-1-onto→{𝑆}) |
14 | f1of 6862 | . . . . . 6 ⊢ ({〈0, 𝑆〉}:{0}–1-1-onto→{𝑆} → {〈0, 𝑆〉}:{0}⟶{𝑆}) | |
15 | 13, 14 | syl 17 | . . . . 5 ⊢ (𝑆 ∈ 𝐵 → {〈0, 𝑆〉}:{0}⟶{𝑆}) |
16 | snssi 4833 | . . . . 5 ⊢ (𝑆 ∈ 𝐵 → {𝑆} ⊆ 𝐵) | |
17 | 15, 16 | fssd 6764 | . . . 4 ⊢ (𝑆 ∈ 𝐵 → {〈0, 𝑆〉}:{0}⟶𝐵) |
18 | fz0sn 13684 | . . . . 5 ⊢ (0...0) = {0} | |
19 | 18 | feq2i 6739 | . . . 4 ⊢ ({〈0, 𝑆〉}:(0...0)⟶𝐵 ↔ {〈0, 𝑆〉}:{0}⟶𝐵) |
20 | 17, 19 | sylibr 234 | . . 3 ⊢ (𝑆 ∈ 𝐵 → {〈0, 𝑆〉}:(0...0)⟶𝐵) |
21 | 3, 4, 6, 10, 20 | gsumval2 18724 | . 2 ⊢ (𝑆 ∈ 𝐵 → (𝐺 Σg {〈0, 𝑆〉}) = (seq0((+g‘𝐺), {〈0, 𝑆〉})‘0)) |
22 | fvsng 7214 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑆 ∈ 𝐵) → ({〈0, 𝑆〉}‘0) = 𝑆) | |
23 | 11, 22 | mpan 689 | . . 3 ⊢ (𝑆 ∈ 𝐵 → ({〈0, 𝑆〉}‘0) = 𝑆) |
24 | 11, 23 | seq1i 14066 | . 2 ⊢ (𝑆 ∈ 𝐵 → (seq0((+g‘𝐺), {〈0, 𝑆〉})‘0) = 𝑆) |
25 | 2, 21, 24 | 3eqtrd 2784 | 1 ⊢ (𝑆 ∈ 𝐵 → (𝐺 Σg 〈“𝑆”〉) = 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 {csn 4648 〈cop 4654 dom cdm 5700 ⟶wf 6569 –1-1-onto→wf1o 6572 ‘cfv 6573 (class class class)co 7448 0cc0 11184 ℕ0cn0 12553 ℤcz 12639 ℤ≥cuz 12903 ...cfz 13567 seqcseq 14052 〈“cs1 14643 Basecbs 17258 +gcplusg 17311 Σg cgsu 17500 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-seq 14053 df-s1 14644 df-0g 17501 df-gsum 17502 |
This theorem is referenced by: gsumws2 18877 gsumccatsn 18878 gsumwspan 18881 frmdgsum 18897 frmdup2 18900 gsumwrev 19409 psgnunilem5 19536 psgnpmtr 19552 frgpup2 19818 cyc3genpmlem 33144 1arithufdlem1 33537 1arithufdlem3 33539 1arithufdlem4 33540 mrsubcv 35478 gsumws3 44158 gsumws4 44159 |
Copyright terms: Public domain | W3C validator |