| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulgz | Structured version Visualization version GIF version | ||
| Description: A group multiple of the identity, for integer multiple. (Contributed by Mario Carneiro, 13-Dec-2014.) |
| Ref | Expression |
|---|---|
| mulgnn0z.b | ⊢ 𝐵 = (Base‘𝐺) |
| mulgnn0z.t | ⊢ · = (.g‘𝐺) |
| mulgnn0z.o | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| mulgz | ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝑁 · 0 ) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpmnd 19201 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → 𝐺 ∈ Mnd) |
| 3 | mulgnn0z.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | mulgnn0z.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 5 | mulgnn0z.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 6 | 3, 4, 5 | mulgnn0z 19361 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑁 ∈ ℕ0) → (𝑁 · 0 ) = 0 ) |
| 7 | 2, 6 | sylan 592 | . 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ∈ ℕ0) → (𝑁 · 0 ) = 0 ) |
| 8 | simpll 779 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → 𝐺 ∈ Grp) | |
| 9 | nn0z 12757 | . . . . 5 ⊢ ( -𝑁 ∈ ℕ0 → -𝑁 ∈ ℤ) | |
| 10 | 9 | adantl 487 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → -𝑁 ∈ ℤ) |
| 11 | 3, 5 | grpidcl 19226 | . . . . 5 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 12 | 11 | ad2antrr 739 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → 0 ∈ 𝐵) |
| 13 | eqid 2763 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 14 | 3, 4, 13 | mulgneg 19352 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ -𝑁 ∈ ℤ ∧ 0 ∈ 𝐵) → ( - -𝑁 · 0 ) = ((invg‘𝐺)‘( -𝑁 · 0 ))) |
| 15 | 8, 10, 12, 14 | syl3anc 1399 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ( - -𝑁 · 0 ) = ((invg‘𝐺)‘( -𝑁 · 0 ))) |
| 16 | zcn 12738 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 17 | 16 | ad2antlr 740 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → 𝑁 ∈ ℂ) |
| 18 | 17 | negnegd 11699 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → - -𝑁 = 𝑁) |
| 19 | 18 | oveq1d 7466 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ( - -𝑁 · 0 ) = (𝑁 · 0 )) |
| 20 | 3, 4, 5 | mulgnn0z 19361 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ -𝑁 ∈ ℕ0) → ( -𝑁 · 0 ) = 0 ) |
| 21 | 2, 20 | sylan 592 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ( -𝑁 · 0 ) = 0 ) |
| 22 | 21 | fveq2d 6920 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ((invg‘𝐺)‘( -𝑁 · 0 )) = ((invg‘𝐺)‘ 0 )) |
| 23 | 5, 13 | grpinvid 19260 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 24 | 23 | ad2antrr 739 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 25 | 22, 24 | eqtrd 2798 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → ((invg‘𝐺)‘( -𝑁 · 0 )) = 0 ) |
| 26 | 15, 19, 25 | 3eqtr3d 2806 | . 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ -𝑁 ∈ ℕ0) → (𝑁 · 0 ) = 0 ) |
| 27 | elznn0 12748 | . . . 4 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) | |
| 28 | 27 | simprbi 503 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0)) |
| 29 | 28 | adantl 487 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0)) |
| 30 | 7, 26, 29 | mpjaodan 973 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝑁 · 0 ) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 -cneg 11581 ℕ0cn0 12646 ℤcz 12733 Basecbs 17431 0gc0g 17660 Mndcmnd 18973 Grpcgrp 19194 invgcminusg 19195 .gcmg 19327 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-seq 14185 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-mulg 19328 |
| This theorem is used by: mulgmodid 19373 odmod 19811 gexdvdsi 19848 primrootscoprmpow 43415 primrootscoprbij 43418 primrootspoweq0 43422 aks6d1c6lem5 43493 grpods 43510 unitscyglem1 43511 unitscyglem4 43514 |
| Copyright terms: Public domain | W3C validator |