| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulgnn0gzsum | 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 |
|---|---|
| mulgnngzsum.b | ⊢ 𝐵 = (Base‘𝐺) |
| mulgnngzsum.t | ⊢ · = (.g‘𝐺) |
| mulgnngzsum.f | ⊢ 𝐹 = (𝑥 ∈ (1...𝑁) ↦ 𝑋) |
| Ref | Expression |
|---|---|
| mulgnn0gzsum | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0 9565 | . . 3 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | mulgnngzsum.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | mulgnngzsum.t | . . . . . 6 ⊢ · = (.g‘𝐺) | |
| 4 | mulgnngzsum.f | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ (1...𝑁) ↦ 𝑋) | |
| 5 | 2, 3, 4 | mulgnngzsum 13930 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹)) |
| 6 | 5 | ex 115 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹))) |
| 7 | 2 | basmex 13412 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝐵 → 𝐺 ∈ V) |
| 8 | 7 | adantl 277 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ V) |
| 9 | eqid 2238 | . . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 10 | 9 | gzsum0 13713 | . . . . . . 7 ⊢ (𝐺 ∈ V → (𝐺 Σgz ∅) = (0g‘𝐺)) |
| 11 | 8, 10 | syl 14 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝐺 Σgz ∅) = (0g‘𝐺)) |
| 12 | oveq2 6093 | . . . . . . . . . . . 12 ⊢ (𝑁 = 0 → (1...𝑁) = (1...0)) | |
| 13 | fz10 10450 | . . . . . . . . . . . 12 ⊢ (1...0) = ∅ | |
| 14 | 12, 13 | eqtrdi 2287 | . . . . . . . . . . 11 ⊢ (𝑁 = 0 → (1...𝑁) = ∅) |
| 15 | 14 | mpteq1d 4216 | . . . . . . . . . 10 ⊢ (𝑁 = 0 → (𝑥 ∈ (1...𝑁) ↦ 𝑋) = (𝑥 ∈ ∅ ↦ 𝑋)) |
| 16 | mpt0 5511 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ∅ ↦ 𝑋) = ∅ | |
| 17 | 15, 16 | eqtrdi 2287 | . . . . . . . . 9 ⊢ (𝑁 = 0 → (𝑥 ∈ (1...𝑁) ↦ 𝑋) = ∅) |
| 18 | 4, 17 | eqtrid 2283 | . . . . . . . 8 ⊢ (𝑁 = 0 → 𝐹 = ∅) |
| 19 | 18 | adantr 276 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → 𝐹 = ∅) |
| 20 | 19 | oveq2d 6101 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝐺 Σgz 𝐹) = (𝐺 Σgz ∅)) |
| 21 | oveq1 6092 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝑁 · 𝑋) = (0 · 𝑋)) | |
| 22 | 2, 9, 3 | mulg0 13928 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = (0g‘𝐺)) |
| 23 | 21, 22 | sylan9eq 2291 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (0g‘𝐺)) |
| 24 | 11, 20, 23 | 3eqtr4rd 2282 | . . . . 5 ⊢ ((𝑁 = 0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹)) |
| 25 | 24 | ex 115 | . . . 4 ⊢ (𝑁 = 0 → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹))) |
| 26 | 6, 25 | jaoi 728 | . . 3 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹))) |
| 27 | 1, 26 | sylbi 121 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ 𝐵 → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹))) |
| 28 | 27 | imp 124 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) = (𝐺 Σgz 𝐹)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∨ wo 720 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∅c0 3520 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 0cc0 8179 1c1 8180 ℕcn 9304 ℕ0cn0 9563 ...cfz 10411 Basecbs 13352 0gc0g 13610 Σgz cgzsu 13611 .gcmg 13922 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-er 6807 df-en 7023 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-2 9363 df-n0 9564 df-z 9645 df-uz 9922 df-fz 10412 df-seqfrec 10885 df-ndx 13355 df-slot 13356 df-base 13358 df-plusg 13444 df-0g 13612 df-gzsum 13613 df-minusg 13809 df-mulg 13923 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |