Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulgnn0gsum | Structured version Visualization version GIF version |
Description: Group multiple (exponentiation) operation at a nonnegative integer expressed by a group sum. This corresponds to the definition in [Lang] p. 6, second formula. (Contributed by AV, 28-Dec-2023.) |
Ref | Expression |
---|---|
mulgnngsum.b | ⊢ 𝐵 = (Base‘𝐺) |
mulgnngsum.t | ⊢ · = (.g‘𝐺) |
mulgnngsum.f | ⊢ 𝐹 = (𝑥 ∈ (1...𝑁) ↦ 𝑋) |
Ref | Expression |
---|---|
mulgnn0gsum | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σg 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 11897 | . . 3 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | mulgnngsum.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
3 | mulgnngsum.t | . . . . . 6 ⊢ · = (.g‘𝐺) | |
4 | mulgnngsum.f | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ (1...𝑁) ↦ 𝑋) | |
5 | 2, 3, 4 | mulgnngsum 18229 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σg 𝐹)) |
6 | 5 | ex 415 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σg 𝐹))) |
7 | oveq1 7160 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝑁 · 𝑋) = (0 · 𝑋)) | |
8 | eqid 2820 | . . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
9 | 2, 8, 3 | mulg0 18227 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = (0g‘𝐺)) |
10 | 7, 9 | sylan9eq 2875 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (0g‘𝐺)) |
11 | oveq2 7161 | . . . . . . . . . . . . 13 ⊢ (𝑁 = 0 → (1...𝑁) = (1...0)) | |
12 | fz10 12926 | . . . . . . . . . . . . 13 ⊢ (1...0) = ∅ | |
13 | 11, 12 | syl6eq 2871 | . . . . . . . . . . . 12 ⊢ (𝑁 = 0 → (1...𝑁) = ∅) |
14 | eqidd 2821 | . . . . . . . . . . . 12 ⊢ (𝑁 = 0 → 𝑋 = 𝑋) | |
15 | 13, 14 | mpteq12dv 5148 | . . . . . . . . . . 11 ⊢ (𝑁 = 0 → (𝑥 ∈ (1...𝑁) ↦ 𝑋) = (𝑥 ∈ ∅ ↦ 𝑋)) |
16 | mpt0 6487 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ ∅ ↦ 𝑋) = ∅ | |
17 | 15, 16 | syl6eq 2871 | . . . . . . . . . 10 ⊢ (𝑁 = 0 → (𝑥 ∈ (1...𝑁) ↦ 𝑋) = ∅) |
18 | 4, 17 | syl5eq 2867 | . . . . . . . . 9 ⊢ (𝑁 = 0 → 𝐹 = ∅) |
19 | 18 | adantr 483 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → 𝐹 = ∅) |
20 | 19 | oveq2d 7169 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝐺 Σg 𝐹) = (𝐺 Σg ∅)) |
21 | 8 | gsum0 17890 | . . . . . . 7 ⊢ (𝐺 Σg ∅) = (0g‘𝐺) |
22 | 20, 21 | syl6eq 2871 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝐺 Σg 𝐹) = (0g‘𝐺)) |
23 | 10, 22 | eqtr4d 2858 | . . . . 5 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σg 𝐹)) |
24 | 23 | ex 415 | . . . 4 ⊢ (𝑁 = 0 → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σg 𝐹))) |
25 | 6, 24 | jaoi 853 | . . 3 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σg 𝐹))) |
26 | 1, 25 | sylbi 219 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σg 𝐹))) |
27 | 26 | imp 409 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σg 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1536 ∈ wcel 2113 ∅c0 4288 ↦ cmpt 5143 ‘cfv 6352 (class class class)co 7153 0cc0 10534 1c1 10535 ℕcn 11635 ℕ0cn0 11895 ...cfz 12890 Basecbs 16479 0gc0g 16709 Σg cgsu 16710 .gcmg 18220 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5200 ax-nul 5207 ax-pow 5263 ax-pr 5327 ax-un 7458 ax-cnex 10590 ax-resscn 10591 ax-1cn 10592 ax-icn 10593 ax-addcl 10594 ax-addrcl 10595 ax-mulcl 10596 ax-mulrcl 10597 ax-mulcom 10598 ax-addass 10599 ax-mulass 10600 ax-distr 10601 ax-i2m1 10602 ax-1ne0 10603 ax-1rid 10604 ax-rnegex 10605 ax-rrecex 10606 ax-cnre 10607 ax-pre-lttri 10608 ax-pre-lttrn 10609 ax-pre-ltadd 10610 ax-pre-mulgt0 10611 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rmo 3145 df-rab 3146 df-v 3495 df-sbc 3771 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4465 df-pw 4538 df-sn 4565 df-pr 4567 df-tp 4569 df-op 4571 df-uni 4836 df-iun 4918 df-br 5064 df-opab 5126 df-mpt 5144 df-tr 5170 df-id 5457 df-eprel 5462 df-po 5471 df-so 5472 df-fr 5511 df-we 5513 df-xp 5558 df-rel 5559 df-cnv 5560 df-co 5561 df-dm 5562 df-rn 5563 df-res 5564 df-ima 5565 df-pred 6145 df-ord 6191 df-on 6192 df-lim 6193 df-suc 6194 df-iota 6311 df-fun 6354 df-fn 6355 df-f 6356 df-f1 6357 df-fo 6358 df-f1o 6359 df-fv 6360 df-riota 7111 df-ov 7156 df-oprab 7157 df-mpo 7158 df-om 7578 df-1st 7686 df-2nd 7687 df-wrecs 7944 df-recs 8005 df-rdg 8043 df-er 8286 df-en 8507 df-dom 8508 df-sdom 8509 df-pnf 10674 df-mnf 10675 df-xr 10676 df-ltxr 10677 df-le 10678 df-sub 10869 df-neg 10870 df-nn 11636 df-n0 11896 df-z 11980 df-uz 12242 df-fz 12891 df-seq 13368 df-0g 16711 df-gsum 16712 df-mulg 18221 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |