![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mulgnn0z | Structured version Visualization version GIF version |
Description: A group multiple of the identity, for nonnegative multiple. (Contributed by Mario Carneiro, 13-Dec-2014.) |
Ref | Expression |
---|---|
mulgnn0z.b | ⊢ 𝐵 = (Base‘𝐺) |
mulgnn0z.t | ⊢ · = (.g‘𝐺) |
mulgnn0z.o | ⊢ 0 = (0g‘𝐺) |
Ref | Expression |
---|---|
mulgnn0z | ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ0) → (𝑁 · 0 ) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 12526 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | id 22 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ) | |
3 | mulgnn0z.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
4 | mulgnn0z.o | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
5 | 3, 4 | mndidcl 18775 | . . . . 5 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝐵) |
6 | eqid 2735 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
7 | mulgnn0z.t | . . . . . 6 ⊢ · = (.g‘𝐺) | |
8 | eqid 2735 | . . . . . 6 ⊢ seq1((+g‘𝐺), (ℕ × { 0 })) = seq1((+g‘𝐺), (ℕ × { 0 })) | |
9 | 3, 6, 7, 8 | mulgnn 19106 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 0 ∈ 𝐵) → (𝑁 · 0 ) = (seq1((+g‘𝐺), (ℕ × { 0 }))‘𝑁)) |
10 | 2, 5, 9 | syl2anr 597 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → (𝑁 · 0 ) = (seq1((+g‘𝐺), (ℕ × { 0 }))‘𝑁)) |
11 | 3, 6, 4 | mndlid 18780 | . . . . . . 7 ⊢ ((𝐺 ∈ Mnd ∧ 0 ∈ 𝐵) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
12 | 5, 11 | mpdan 687 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → ( 0 (+g‘𝐺) 0 ) = 0 ) |
13 | 12 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
14 | simpr 484 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
15 | nnuz 12919 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
16 | 14, 15 | eleqtrdi 2849 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ (ℤ≥‘1)) |
17 | 5 | adantr 480 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → 0 ∈ 𝐵) |
18 | elfznn 13590 | . . . . . 6 ⊢ (𝑥 ∈ (1...𝑁) → 𝑥 ∈ ℕ) | |
19 | fvconst2g 7222 | . . . . . 6 ⊢ (( 0 ∈ 𝐵 ∧ 𝑥 ∈ ℕ) → ((ℕ × { 0 })‘𝑥) = 0 ) | |
20 | 17, 18, 19 | syl2an 596 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (1...𝑁)) → ((ℕ × { 0 })‘𝑥) = 0 ) |
21 | 13, 16, 20 | seqid3 14084 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → (seq1((+g‘𝐺), (ℕ × { 0 }))‘𝑁) = 0 ) |
22 | 10, 21 | eqtrd 2775 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ) → (𝑁 · 0 ) = 0 ) |
23 | oveq1 7438 | . . . 4 ⊢ (𝑁 = 0 → (𝑁 · 0 ) = (0 · 0 )) | |
24 | 3, 4, 7 | mulg0 19105 | . . . . 5 ⊢ ( 0 ∈ 𝐵 → (0 · 0 ) = 0 ) |
25 | 5, 24 | syl 17 | . . . 4 ⊢ (𝐺 ∈ Mnd → (0 · 0 ) = 0 ) |
26 | 23, 25 | sylan9eqr 2797 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 = 0) → (𝑁 · 0 ) = 0 ) |
27 | 22, 26 | jaodan 959 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝑁 · 0 ) = 0 ) |
28 | 1, 27 | sylan2b 594 | 1 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ0) → (𝑁 · 0 ) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1537 ∈ wcel 2106 {csn 4631 × cxp 5687 ‘cfv 6563 (class class class)co 7431 0cc0 11153 1c1 11154 ℕcn 12264 ℕ0cn0 12524 ℤ≥cuz 12876 ...cfz 13544 seqcseq 14039 Basecbs 17245 +gcplusg 17298 0gc0g 17486 Mndcmnd 18760 .gcmg 19098 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-seq 14040 df-0g 17488 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-mulg 19099 |
This theorem is referenced by: mulgz 19133 mulgnn0ass 19141 odmodnn0 19573 mulgmhm 19860 srg1expzeq1 20243 frobrhm 21612 psdmplcl 22184 lply1binomsc 22331 tsmsxp 24179 aks6d1c1p6 42096 aks6d1c2lem3 42108 |
Copyright terms: Public domain | W3C validator |